java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:03:45,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:03:45,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:03:45,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:03:45,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:03:45,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:03:45,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:03:45,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:03:45,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:03:45,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:03:45,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:03:45,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:03:45,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:03:45,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:03:45,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:03:45,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:03:45,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:03:45,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:03:45,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:03:45,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:03:45,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:03:45,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:03:45,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:03:45,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:03:45,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:03:45,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:03:45,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:03:45,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:03:45,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:03:45,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:03:45,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:03:45,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:03:45,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:03:45,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:03:45,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:03:45,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:03:45,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:03:45,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:03:45,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:03:45,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:03:45,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:03:45,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:03:45,899 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:03:45,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:03:45,900 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:03:45,901 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:03:45,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:03:45,901 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:03:45,902 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:03:45,902 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:03:45,902 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:03:45,902 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:03:45,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:03:45,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:03:45,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:03:45,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:03:45,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:03:45,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:03:45,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:03:45,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:03:45,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:03:45,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:03:45,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:03:45,906 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:03:45,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:03:45,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:03:45,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:03:45,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:03:45,908 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:03:45,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:03:45,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:03:45,908 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:03:45,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:03:45,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:03:45,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:03:45,963 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:03:45,963 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:03:45,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:03:46,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020439f94/66b3bebd85ee4b7eb13a45a96a6828a1/FLAGf69f9cf86 [2019-09-10 06:03:46,498 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:03:46,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:03:46,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020439f94/66b3bebd85ee4b7eb13a45a96a6828a1/FLAGf69f9cf86 [2019-09-10 06:03:46,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020439f94/66b3bebd85ee4b7eb13a45a96a6828a1 [2019-09-10 06:03:46,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:03:46,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:03:46,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:03:46,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:03:46,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:03:46,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:03:46" (1/1) ... [2019-09-10 06:03:46,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb9c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:46, skipping insertion in model container [2019-09-10 06:03:46,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:03:46" (1/1) ... [2019-09-10 06:03:46,874 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:03:46,914 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:03:47,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:03:47,273 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:03:47,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:03:47,391 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:03:47,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47 WrapperNode [2019-09-10 06:03:47,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:03:47,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:03:47,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:03:47,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:03:47,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47" (1/1) ... [2019-09-10 06:03:47,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47" (1/1) ... [2019-09-10 06:03:47,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47" (1/1) ... [2019-09-10 06:03:47,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47" (1/1) ... [2019-09-10 06:03:47,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47" (1/1) ... [2019-09-10 06:03:47,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47" (1/1) ... [2019-09-10 06:03:47,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47" (1/1) ... [2019-09-10 06:03:47,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:03:47,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:03:47,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:03:47,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:03:47,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:03:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:03:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:03:47,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:03:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:03:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:03:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:03:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:03:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:03:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:03:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:03:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:03:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:03:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:03:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:03:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:03:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:03:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:03:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:03:48,209 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:03:48,209 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:03:48,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:03:48 BoogieIcfgContainer [2019-09-10 06:03:48,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:03:48,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:03:48,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:03:48,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:03:48,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:03:46" (1/3) ... [2019-09-10 06:03:48,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a00fc5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:03:48, skipping insertion in model container [2019-09-10 06:03:48,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:03:47" (2/3) ... [2019-09-10 06:03:48,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a00fc5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:03:48, skipping insertion in model container [2019-09-10 06:03:48,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:03:48" (3/3) ... [2019-09-10 06:03:48,218 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:03:48,228 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:03:48,236 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:03:48,252 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:03:48,275 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:03:48,275 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:03:48,275 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:03:48,275 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:03:48,276 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:03:48,276 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:03:48,276 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:03:48,276 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:03:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2019-09-10 06:03:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:03:48,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:48,304 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] [2019-09-10 06:03:48,306 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash -216024821, now seen corresponding path program 1 times [2019-09-10 06:03:48,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:48,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:48,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:48,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:48,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:48,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:48,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:03:48,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:48,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:03:48,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:03:48,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:48,733 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 3 states. [2019-09-10 06:03:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:48,861 INFO L93 Difference]: Finished difference Result 207 states and 342 transitions. [2019-09-10 06:03:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:03:48,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:03:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:48,887 INFO L225 Difference]: With dead ends: 207 [2019-09-10 06:03:48,887 INFO L226 Difference]: Without dead ends: 199 [2019-09-10 06:03:48,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-10 06:03:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-09-10 06:03:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-10 06:03:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 311 transitions. [2019-09-10 06:03:48,982 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 311 transitions. Word has length 55 [2019-09-10 06:03:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:48,983 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 311 transitions. [2019-09-10 06:03:48,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:03:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 311 transitions. [2019-09-10 06:03:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:03:48,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:48,992 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] [2019-09-10 06:03:48,992 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:48,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1873640104, now seen corresponding path program 1 times [2019-09-10 06:03:48,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:48,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:48,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:49,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:49,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:03:49,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:49,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:03:49,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:03:49,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:49,158 INFO L87 Difference]: Start difference. First operand 197 states and 311 transitions. Second operand 3 states. [2019-09-10 06:03:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:49,201 INFO L93 Difference]: Finished difference Result 328 states and 524 transitions. [2019-09-10 06:03:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:03:49,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 06:03:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:49,204 INFO L225 Difference]: With dead ends: 328 [2019-09-10 06:03:49,204 INFO L226 Difference]: Without dead ends: 328 [2019-09-10 06:03:49,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-10 06:03:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2019-09-10 06:03:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-10 06:03:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 523 transitions. [2019-09-10 06:03:49,224 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 523 transitions. Word has length 57 [2019-09-10 06:03:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:49,224 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 523 transitions. [2019-09-10 06:03:49,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:03:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 523 transitions. [2019-09-10 06:03:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:03:49,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:49,227 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] [2019-09-10 06:03:49,227 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:49,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:49,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2071269952, now seen corresponding path program 1 times [2019-09-10 06:03:49,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:49,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:49,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:49,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:49,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:49,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:49,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:03:49,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:49,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:03:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:03:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:49,348 INFO L87 Difference]: Start difference. First operand 326 states and 523 transitions. Second operand 3 states. [2019-09-10 06:03:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:49,376 INFO L93 Difference]: Finished difference Result 456 states and 734 transitions. [2019-09-10 06:03:49,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:03:49,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:03:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:49,380 INFO L225 Difference]: With dead ends: 456 [2019-09-10 06:03:49,380 INFO L226 Difference]: Without dead ends: 456 [2019-09-10 06:03:49,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-10 06:03:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 454. [2019-09-10 06:03:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-09-10 06:03:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 733 transitions. [2019-09-10 06:03:49,403 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 733 transitions. Word has length 59 [2019-09-10 06:03:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:49,403 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 733 transitions. [2019-09-10 06:03:49,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:03:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 733 transitions. [2019-09-10 06:03:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:03:49,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:49,405 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] [2019-09-10 06:03:49,405 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1286363541, now seen corresponding path program 1 times [2019-09-10 06:03:49,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:49,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:49,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:49,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:49,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:49,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:03:49,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:49,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:03:49,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:03:49,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:49,473 INFO L87 Difference]: Start difference. First operand 454 states and 733 transitions. Second operand 3 states. [2019-09-10 06:03:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:49,498 INFO L93 Difference]: Finished difference Result 791 states and 1276 transitions. [2019-09-10 06:03:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:03:49,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:03:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:49,503 INFO L225 Difference]: With dead ends: 791 [2019-09-10 06:03:49,503 INFO L226 Difference]: Without dead ends: 791 [2019-09-10 06:03:49,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-10 06:03:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2019-09-10 06:03:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-10 06:03:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1275 transitions. [2019-09-10 06:03:49,527 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1275 transitions. Word has length 59 [2019-09-10 06:03:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:49,527 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1275 transitions. [2019-09-10 06:03:49,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:03:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1275 transitions. [2019-09-10 06:03:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:03:49,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:49,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:03:49,530 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:49,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:49,530 INFO L82 PathProgramCache]: Analyzing trace with hash 177113208, now seen corresponding path program 1 times [2019-09-10 06:03:49,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:49,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:49,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:49,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:49,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:49,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:03:49,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:49,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:03:49,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:03:49,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:03:49,647 INFO L87 Difference]: Start difference. First operand 789 states and 1275 transitions. Second operand 5 states. [2019-09-10 06:03:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:49,770 INFO L93 Difference]: Finished difference Result 2013 states and 3295 transitions. [2019-09-10 06:03:49,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:03:49,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 06:03:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:49,781 INFO L225 Difference]: With dead ends: 2013 [2019-09-10 06:03:49,781 INFO L226 Difference]: Without dead ends: 2013 [2019-09-10 06:03:49,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:03:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2019-09-10 06:03:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1755. [2019-09-10 06:03:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-09-10 06:03:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2862 transitions. [2019-09-10 06:03:49,835 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2862 transitions. Word has length 61 [2019-09-10 06:03:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:49,836 INFO L475 AbstractCegarLoop]: Abstraction has 1755 states and 2862 transitions. [2019-09-10 06:03:49,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:03:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2862 transitions. [2019-09-10 06:03:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:03:49,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:49,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] [2019-09-10 06:03:49,838 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:49,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:49,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1133931662, now seen corresponding path program 1 times [2019-09-10 06:03:49,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:49,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:49,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:49,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:49,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:49,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:49,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:03:49,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:49,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:03:49,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:03:49,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:03:49,957 INFO L87 Difference]: Start difference. First operand 1755 states and 2862 transitions. Second operand 6 states. [2019-09-10 06:03:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:50,160 INFO L93 Difference]: Finished difference Result 4994 states and 8145 transitions. [2019-09-10 06:03:50,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:03:50,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-09-10 06:03:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:50,187 INFO L225 Difference]: With dead ends: 4994 [2019-09-10 06:03:50,187 INFO L226 Difference]: Without dead ends: 4994 [2019-09-10 06:03:50,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:03:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-09-10 06:03:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4925. [2019-09-10 06:03:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4925 states. [2019-09-10 06:03:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 8044 transitions. [2019-09-10 06:03:50,351 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 8044 transitions. Word has length 62 [2019-09-10 06:03:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:50,352 INFO L475 AbstractCegarLoop]: Abstraction has 4925 states and 8044 transitions. [2019-09-10 06:03:50,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:03:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 8044 transitions. [2019-09-10 06:03:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:03:50,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:50,359 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] [2019-09-10 06:03:50,359 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:50,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:50,360 INFO L82 PathProgramCache]: Analyzing trace with hash 34003292, now seen corresponding path program 1 times [2019-09-10 06:03:50,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:50,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:50,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:50,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 06:03:50,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:50,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:03:50,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:50,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:03:50,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:03:50,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:50,483 INFO L87 Difference]: Start difference. First operand 4925 states and 8044 transitions. Second operand 3 states. [2019-09-10 06:03:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:50,605 INFO L93 Difference]: Finished difference Result 6699 states and 10892 transitions. [2019-09-10 06:03:50,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:03:50,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:03:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:50,644 INFO L225 Difference]: With dead ends: 6699 [2019-09-10 06:03:50,644 INFO L226 Difference]: Without dead ends: 6699 [2019-09-10 06:03:50,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2019-09-10 06:03:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 6697. [2019-09-10 06:03:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6697 states. [2019-09-10 06:03:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6697 states to 6697 states and 10891 transitions. [2019-09-10 06:03:50,844 INFO L78 Accepts]: Start accepts. Automaton has 6697 states and 10891 transitions. Word has length 62 [2019-09-10 06:03:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:50,845 INFO L475 AbstractCegarLoop]: Abstraction has 6697 states and 10891 transitions. [2019-09-10 06:03:50,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:03:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 6697 states and 10891 transitions. [2019-09-10 06:03:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:03:50,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:50,847 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] [2019-09-10 06:03:50,847 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:50,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:50,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1402780260, now seen corresponding path program 1 times [2019-09-10 06:03:50,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:50,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:50,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:50,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:50,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:50,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:50,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:03:50,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:50,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:03:50,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:03:50,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:50,913 INFO L87 Difference]: Start difference. First operand 6697 states and 10891 transitions. Second operand 3 states. [2019-09-10 06:03:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:50,976 INFO L93 Difference]: Finished difference Result 9913 states and 16094 transitions. [2019-09-10 06:03:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:03:50,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:03:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:51,037 INFO L225 Difference]: With dead ends: 9913 [2019-09-10 06:03:51,037 INFO L226 Difference]: Without dead ends: 9913 [2019-09-10 06:03:51,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9913 states. [2019-09-10 06:03:51,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9913 to 9911. [2019-09-10 06:03:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9911 states. [2019-09-10 06:03:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9911 states to 9911 states and 16093 transitions. [2019-09-10 06:03:51,276 INFO L78 Accepts]: Start accepts. Automaton has 9911 states and 16093 transitions. Word has length 62 [2019-09-10 06:03:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:51,277 INFO L475 AbstractCegarLoop]: Abstraction has 9911 states and 16093 transitions. [2019-09-10 06:03:51,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:03:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 9911 states and 16093 transitions. [2019-09-10 06:03:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:03:51,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:51,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:03:51,278 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash 735090687, now seen corresponding path program 1 times [2019-09-10 06:03:51,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:51,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:51,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:51,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:51,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:51,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:03:51,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:51,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:03:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:03:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:03:51,352 INFO L87 Difference]: Start difference. First operand 9911 states and 16093 transitions. Second operand 4 states. [2019-09-10 06:03:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:51,462 INFO L93 Difference]: Finished difference Result 15478 states and 25077 transitions. [2019-09-10 06:03:51,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:03:51,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-10 06:03:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:51,494 INFO L225 Difference]: With dead ends: 15478 [2019-09-10 06:03:51,495 INFO L226 Difference]: Without dead ends: 15478 [2019-09-10 06:03:51,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:03:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15478 states. [2019-09-10 06:03:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15478 to 15411. [2019-09-10 06:03:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15411 states. [2019-09-10 06:03:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15411 states to 15411 states and 24949 transitions. [2019-09-10 06:03:51,868 INFO L78 Accepts]: Start accepts. Automaton has 15411 states and 24949 transitions. Word has length 63 [2019-09-10 06:03:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:51,868 INFO L475 AbstractCegarLoop]: Abstraction has 15411 states and 24949 transitions. [2019-09-10 06:03:51,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:03:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15411 states and 24949 transitions. [2019-09-10 06:03:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:03:51,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:51,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:03:51,870 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:51,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1260480373, now seen corresponding path program 1 times [2019-09-10 06:03:51,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:51,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:51,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:51,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:51,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:51,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:51,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:03:51,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:51,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:03:51,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:03:51,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:03:51,958 INFO L87 Difference]: Start difference. First operand 15411 states and 24949 transitions. Second operand 4 states. [2019-09-10 06:03:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:52,114 INFO L93 Difference]: Finished difference Result 30201 states and 48916 transitions. [2019-09-10 06:03:52,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:03:52,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-10 06:03:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:52,185 INFO L225 Difference]: With dead ends: 30201 [2019-09-10 06:03:52,185 INFO L226 Difference]: Without dead ends: 30201 [2019-09-10 06:03:52,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:03:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30201 states. [2019-09-10 06:03:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30201 to 22719. [2019-09-10 06:03:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22719 states. [2019-09-10 06:03:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22719 states to 22719 states and 36685 transitions. [2019-09-10 06:03:53,107 INFO L78 Accepts]: Start accepts. Automaton has 22719 states and 36685 transitions. Word has length 64 [2019-09-10 06:03:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:53,108 INFO L475 AbstractCegarLoop]: Abstraction has 22719 states and 36685 transitions. [2019-09-10 06:03:53,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:03:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 22719 states and 36685 transitions. [2019-09-10 06:03:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:03:53,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:53,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:03:53,112 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:53,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1348775483, now seen corresponding path program 1 times [2019-09-10 06:03:53,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:53,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:53,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:53,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:53,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:53,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:53,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:03:53,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:53,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:03:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:03:53,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:03:53,268 INFO L87 Difference]: Start difference. First operand 22719 states and 36685 transitions. Second operand 5 states. [2019-09-10 06:03:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:53,407 INFO L93 Difference]: Finished difference Result 24427 states and 39365 transitions. [2019-09-10 06:03:53,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:03:53,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 06:03:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:53,446 INFO L225 Difference]: With dead ends: 24427 [2019-09-10 06:03:53,447 INFO L226 Difference]: Without dead ends: 24427 [2019-09-10 06:03:53,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:03:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24427 states. [2019-09-10 06:03:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24427 to 22719. [2019-09-10 06:03:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22719 states. [2019-09-10 06:03:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22719 states to 22719 states and 36550 transitions. [2019-09-10 06:03:53,911 INFO L78 Accepts]: Start accepts. Automaton has 22719 states and 36550 transitions. Word has length 66 [2019-09-10 06:03:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:53,912 INFO L475 AbstractCegarLoop]: Abstraction has 22719 states and 36550 transitions. [2019-09-10 06:03:53,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:03:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 22719 states and 36550 transitions. [2019-09-10 06:03:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:03:53,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:53,913 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:03:53,913 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:53,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash 294074000, now seen corresponding path program 1 times [2019-09-10 06:03:53,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:53,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:53,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:53,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:53,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:54,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:54,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:03:54,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:54,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:03:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:03:54,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:03:54,045 INFO L87 Difference]: Start difference. First operand 22719 states and 36550 transitions. Second operand 5 states. [2019-09-10 06:03:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:54,228 INFO L93 Difference]: Finished difference Result 41382 states and 66185 transitions. [2019-09-10 06:03:54,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:03:54,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-10 06:03:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:54,282 INFO L225 Difference]: With dead ends: 41382 [2019-09-10 06:03:54,282 INFO L226 Difference]: Without dead ends: 41382 [2019-09-10 06:03:54,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:03:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41382 states. [2019-09-10 06:03:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41382 to 41380. [2019-09-10 06:03:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41380 states. [2019-09-10 06:03:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41380 states to 41380 states and 66184 transitions. [2019-09-10 06:03:54,946 INFO L78 Accepts]: Start accepts. Automaton has 41380 states and 66184 transitions. Word has length 69 [2019-09-10 06:03:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:54,946 INFO L475 AbstractCegarLoop]: Abstraction has 41380 states and 66184 transitions. [2019-09-10 06:03:54,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:03:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 41380 states and 66184 transitions. [2019-09-10 06:03:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:03:54,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:54,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:03:54,948 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:54,948 INFO L82 PathProgramCache]: Analyzing trace with hash 524450082, now seen corresponding path program 1 times [2019-09-10 06:03:54,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:54,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:54,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:54,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:54,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:55,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:55,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:03:55,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:55,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:03:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:03:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:03:55,039 INFO L87 Difference]: Start difference. First operand 41380 states and 66184 transitions. Second operand 5 states. [2019-09-10 06:03:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:55,934 INFO L93 Difference]: Finished difference Result 72828 states and 115270 transitions. [2019-09-10 06:03:55,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:03:55,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 06:03:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:56,018 INFO L225 Difference]: With dead ends: 72828 [2019-09-10 06:03:56,018 INFO L226 Difference]: Without dead ends: 72828 [2019-09-10 06:03:56,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:03:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72828 states. [2019-09-10 06:03:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72828 to 42456. [2019-09-10 06:03:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42456 states. [2019-09-10 06:03:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42456 states to 42456 states and 67251 transitions. [2019-09-10 06:03:56,701 INFO L78 Accepts]: Start accepts. Automaton has 42456 states and 67251 transitions. Word has length 70 [2019-09-10 06:03:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:56,702 INFO L475 AbstractCegarLoop]: Abstraction has 42456 states and 67251 transitions. [2019-09-10 06:03:56,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:03:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 42456 states and 67251 transitions. [2019-09-10 06:03:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:03:56,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:56,705 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:03:56,705 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:56,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash -937454614, now seen corresponding path program 1 times [2019-09-10 06:03:56,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:56,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:56,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:03:56,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:56,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:03:56,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:56,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:03:56,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:03:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:03:56,888 INFO L87 Difference]: Start difference. First operand 42456 states and 67251 transitions. Second operand 4 states. [2019-09-10 06:03:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:57,121 INFO L93 Difference]: Finished difference Result 69541 states and 110367 transitions. [2019-09-10 06:03:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:03:57,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 06:03:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:57,214 INFO L225 Difference]: With dead ends: 69541 [2019-09-10 06:03:57,215 INFO L226 Difference]: Without dead ends: 69541 [2019-09-10 06:03:57,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:03:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69541 states. [2019-09-10 06:03:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69541 to 61169. [2019-09-10 06:03:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61169 states. [2019-09-10 06:03:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61169 states to 61169 states and 97100 transitions. [2019-09-10 06:03:58,080 INFO L78 Accepts]: Start accepts. Automaton has 61169 states and 97100 transitions. Word has length 91 [2019-09-10 06:03:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:58,080 INFO L475 AbstractCegarLoop]: Abstraction has 61169 states and 97100 transitions. [2019-09-10 06:03:58,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:03:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 61169 states and 97100 transitions. [2019-09-10 06:03:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:03:58,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:58,083 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:03:58,083 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:58,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -909176725, now seen corresponding path program 1 times [2019-09-10 06:03:58,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:58,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:58,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:03:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:03:58,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:03:58,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:03:58,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:03:58,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:03:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:03:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:58,154 INFO L87 Difference]: Start difference. First operand 61169 states and 97100 transitions. Second operand 3 states. [2019-09-10 06:03:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:03:58,297 INFO L93 Difference]: Finished difference Result 52670 states and 83619 transitions. [2019-09-10 06:03:58,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:03:58,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 06:03:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:03:58,360 INFO L225 Difference]: With dead ends: 52670 [2019-09-10 06:03:58,361 INFO L226 Difference]: Without dead ends: 52670 [2019-09-10 06:03:58,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:03:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52670 states. [2019-09-10 06:03:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52670 to 52664. [2019-09-10 06:03:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52664 states. [2019-09-10 06:03:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52664 states to 52664 states and 83614 transitions. [2019-09-10 06:03:59,853 INFO L78 Accepts]: Start accepts. Automaton has 52664 states and 83614 transitions. Word has length 91 [2019-09-10 06:03:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:03:59,853 INFO L475 AbstractCegarLoop]: Abstraction has 52664 states and 83614 transitions. [2019-09-10 06:03:59,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:03:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 52664 states and 83614 transitions. [2019-09-10 06:03:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:03:59,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:03:59,855 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:03:59,855 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:03:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:03:59,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2083337836, now seen corresponding path program 1 times [2019-09-10 06:03:59,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:03:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:59,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:03:59,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:03:59,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:03:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:04:00,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:00,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:04:00,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:00,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:00,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:00,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:04:00,050 INFO L87 Difference]: Start difference. First operand 52664 states and 83614 transitions. Second operand 4 states. [2019-09-10 06:04:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:00,288 INFO L93 Difference]: Finished difference Result 88397 states and 140679 transitions. [2019-09-10 06:04:00,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:04:00,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 06:04:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:00,375 INFO L225 Difference]: With dead ends: 88397 [2019-09-10 06:04:00,375 INFO L226 Difference]: Without dead ends: 88397 [2019-09-10 06:04:00,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:04:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88397 states. [2019-09-10 06:04:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88397 to 77811. [2019-09-10 06:04:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77811 states. [2019-09-10 06:04:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77811 states to 77811 states and 123831 transitions. [2019-09-10 06:04:01,353 INFO L78 Accepts]: Start accepts. Automaton has 77811 states and 123831 transitions. Word has length 91 [2019-09-10 06:04:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:01,354 INFO L475 AbstractCegarLoop]: Abstraction has 77811 states and 123831 transitions. [2019-09-10 06:04:01,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 77811 states and 123831 transitions. [2019-09-10 06:04:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:04:01,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:01,356 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:01,356 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1348321077, now seen corresponding path program 1 times [2019-09-10 06:04:01,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:01,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:01,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:01,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:04:01,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:01,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:04:01,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:01,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:01,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:04:01,508 INFO L87 Difference]: Start difference. First operand 77811 states and 123831 transitions. Second operand 4 states. [2019-09-10 06:04:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:03,312 INFO L93 Difference]: Finished difference Result 160229 states and 253761 transitions. [2019-09-10 06:04:03,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:04:03,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 06:04:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:03,521 INFO L225 Difference]: With dead ends: 160229 [2019-09-10 06:04:03,522 INFO L226 Difference]: Without dead ends: 160229 [2019-09-10 06:04:03,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:04:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160229 states. [2019-09-10 06:04:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160229 to 134950. [2019-09-10 06:04:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134950 states. [2019-09-10 06:04:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134950 states to 134950 states and 214224 transitions. [2019-09-10 06:04:04,832 INFO L78 Accepts]: Start accepts. Automaton has 134950 states and 214224 transitions. Word has length 91 [2019-09-10 06:04:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:04,833 INFO L475 AbstractCegarLoop]: Abstraction has 134950 states and 214224 transitions. [2019-09-10 06:04:04,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 134950 states and 214224 transitions. [2019-09-10 06:04:04,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:04:04,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:04,834 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:04,834 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:04,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:04,834 INFO L82 PathProgramCache]: Analyzing trace with hash -913631143, now seen corresponding path program 1 times [2019-09-10 06:04:04,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:04,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:04,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:04,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:04,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:04:04,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:04,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:04:04,941 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2019-09-10 06:04:04,943 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [125], [129], [151], [179], [182], [185], [188], [191], [194], [198], [206], [208], [211], [212], [214], [223], [226], [230], [235], [237], [240], [264], [267], [292], [300], [308], [314], [318], [322], [324], [327], [352], [360], [368], [374], [378], [382], [384], [387], [412], [420], [428], [534], [535], [539], [540], [541] [2019-09-10 06:04:04,983 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:04:04,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:04:05,128 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:04:05,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:04:05,719 INFO L272 AbstractInterpreter]: Visited 84 different actions 425 times. Merged at 44 different actions 305 times. Widened at 20 different actions 44 times. Performed 1359 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1359 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 162 variables. [2019-09-10 06:04:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:05,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:04:05,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:05,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:04:05,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:05,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:04:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:05,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 06:04:05,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:04:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:04:05,958 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:04:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:04:06,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:04:06,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 9 [2019-09-10 06:04:06,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:06,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:06,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:06,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:04:06,027 INFO L87 Difference]: Start difference. First operand 134950 states and 214224 transitions. Second operand 4 states. [2019-09-10 06:04:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:06,435 INFO L93 Difference]: Finished difference Result 58652 states and 92452 transitions. [2019-09-10 06:04:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:04:06,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-10 06:04:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:06,704 INFO L225 Difference]: With dead ends: 58652 [2019-09-10 06:04:06,704 INFO L226 Difference]: Without dead ends: 58652 [2019-09-10 06:04:06,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:04:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58652 states. [2019-09-10 06:04:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58652 to 58650. [2019-09-10 06:04:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58650 states. [2019-09-10 06:04:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58650 states to 58650 states and 92451 transitions. [2019-09-10 06:04:09,586 INFO L78 Accepts]: Start accepts. Automaton has 58650 states and 92451 transitions. Word has length 96 [2019-09-10 06:04:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:09,587 INFO L475 AbstractCegarLoop]: Abstraction has 58650 states and 92451 transitions. [2019-09-10 06:04:09,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 58650 states and 92451 transitions. [2019-09-10 06:04:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:04:09,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:09,588 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:09,589 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1887652040, now seen corresponding path program 1 times [2019-09-10 06:04:09,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:09,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:09,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:09,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:09,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:04:09,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:09,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:04:09,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2019-09-10 06:04:09,737 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [125], [129], [151], [155], [177], [179], [182], [185], [188], [191], [194], [198], [206], [208], [211], [212], [214], [223], [226], [230], [235], [237], [240], [254], [258], [262], [264], [267], [292], [300], [308], [314], [318], [322], [324], [327], [352], [360], [368], [374], [378], [382], [384], [387], [412], [420], [428], [534], [535], [539], [540], [541] [2019-09-10 06:04:09,741 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:04:09,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:04:09,769 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:04:10,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:04:10,058 INFO L272 AbstractInterpreter]: Visited 89 different actions 522 times. Merged at 49 different actions 378 times. Widened at 26 different actions 64 times. Performed 1626 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 16 different actions. Largest state had 162 variables. [2019-09-10 06:04:10,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:10,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:04:10,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:10,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:04:10,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:10,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:04:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:10,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:04:10,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:04:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:04:10,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:04:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-10 06:04:10,353 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:04:10,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:04:10,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:10,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:10,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:10,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:04:10,356 INFO L87 Difference]: Start difference. First operand 58650 states and 92451 transitions. Second operand 4 states. [2019-09-10 06:04:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:10,751 INFO L93 Difference]: Finished difference Result 113732 states and 177732 transitions. [2019-09-10 06:04:10,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:04:10,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-10 06:04:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:10,966 INFO L225 Difference]: With dead ends: 113732 [2019-09-10 06:04:10,966 INFO L226 Difference]: Without dead ends: 113732 [2019-09-10 06:04:10,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:04:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113732 states. [2019-09-10 06:04:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113732 to 113730. [2019-09-10 06:04:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113730 states. [2019-09-10 06:04:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113730 states to 113730 states and 177731 transitions. [2019-09-10 06:04:12,863 INFO L78 Accepts]: Start accepts. Automaton has 113730 states and 177731 transitions. Word has length 96 [2019-09-10 06:04:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:12,863 INFO L475 AbstractCegarLoop]: Abstraction has 113730 states and 177731 transitions. [2019-09-10 06:04:12,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 113730 states and 177731 transitions. [2019-09-10 06:04:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:04:12,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:12,865 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:12,865 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash 785612522, now seen corresponding path program 1 times [2019-09-10 06:04:12,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:12,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:12,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:12,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:12,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:04:12,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:12,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:12,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:12,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:12,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:12,915 INFO L87 Difference]: Start difference. First operand 113730 states and 177731 transitions. Second operand 3 states. [2019-09-10 06:04:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:14,093 INFO L93 Difference]: Finished difference Result 227438 states and 355427 transitions. [2019-09-10 06:04:14,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:14,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:04:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:14,494 INFO L225 Difference]: With dead ends: 227438 [2019-09-10 06:04:14,494 INFO L226 Difference]: Without dead ends: 227438 [2019-09-10 06:04:14,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227438 states. [2019-09-10 06:04:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227438 to 113732. [2019-09-10 06:04:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113732 states. [2019-09-10 06:04:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113732 states to 113732 states and 177733 transitions. [2019-09-10 06:04:18,854 INFO L78 Accepts]: Start accepts. Automaton has 113732 states and 177733 transitions. Word has length 97 [2019-09-10 06:04:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:18,854 INFO L475 AbstractCegarLoop]: Abstraction has 113732 states and 177733 transitions. [2019-09-10 06:04:18,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 113732 states and 177733 transitions. [2019-09-10 06:04:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:04:18,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:18,856 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:18,856 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:18,856 INFO L82 PathProgramCache]: Analyzing trace with hash -30446796, now seen corresponding path program 1 times [2019-09-10 06:04:18,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:18,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:18,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:18,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:18,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:04:18,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:18,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:18,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:18,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:18,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:18,923 INFO L87 Difference]: Start difference. First operand 113732 states and 177733 transitions. Second operand 3 states. [2019-09-10 06:04:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:19,414 INFO L93 Difference]: Finished difference Result 220478 states and 341392 transitions. [2019-09-10 06:04:19,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:19,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:04:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:19,694 INFO L225 Difference]: With dead ends: 220478 [2019-09-10 06:04:19,694 INFO L226 Difference]: Without dead ends: 220478 [2019-09-10 06:04:19,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220478 states. [2019-09-10 06:04:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220478 to 220476. [2019-09-10 06:04:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220476 states. [2019-09-10 06:04:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220476 states to 220476 states and 341391 transitions. [2019-09-10 06:04:22,243 INFO L78 Accepts]: Start accepts. Automaton has 220476 states and 341391 transitions. Word has length 98 [2019-09-10 06:04:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:22,244 INFO L475 AbstractCegarLoop]: Abstraction has 220476 states and 341391 transitions. [2019-09-10 06:04:22,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 220476 states and 341391 transitions. [2019-09-10 06:04:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:04:22,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:22,246 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:22,246 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:22,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:22,247 INFO L82 PathProgramCache]: Analyzing trace with hash -820825327, now seen corresponding path program 1 times [2019-09-10 06:04:22,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:22,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:22,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:22,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:22,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:04:25,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:25,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:04:25,612 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:04:25,612 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [125], [129], [151], [155], [177], [179], [182], [185], [188], [191], [194], [198], [206], [208], [211], [212], [214], [223], [226], [230], [235], [237], [240], [254], [258], [262], [264], [267], [292], [300], [308], [314], [318], [322], [324], [327], [352], [360], [368], [374], [378], [382], [384], [387], [412], [420], [428], [494], [497], [503], [534], [535], [539], [540], [541] [2019-09-10 06:04:25,616 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:04:25,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:04:25,652 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:04:26,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:04:26,054 INFO L272 AbstractInterpreter]: Visited 91 different actions 524 times. Merged at 49 different actions 378 times. Widened at 26 different actions 64 times. Performed 1627 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1627 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 16 different actions. Largest state had 162 variables. [2019-09-10 06:04:26,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:26,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:04:26,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:26,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:04:26,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:26,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:04:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:26,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:04:26,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:04:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:04:26,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:04:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-10 06:04:26,309 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:04:26,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:04:26,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:26,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:26,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:04:26,311 INFO L87 Difference]: Start difference. First operand 220476 states and 341391 transitions. Second operand 4 states. [2019-09-10 06:04:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:26,842 INFO L93 Difference]: Finished difference Result 220700 states and 338808 transitions. [2019-09-10 06:04:26,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:04:26,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-10 06:04:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:27,120 INFO L225 Difference]: With dead ends: 220700 [2019-09-10 06:04:27,120 INFO L226 Difference]: Without dead ends: 220588 [2019-09-10 06:04:27,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:04:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220588 states. [2019-09-10 06:04:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220588 to 220586. [2019-09-10 06:04:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220586 states. [2019-09-10 06:04:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220586 states to 220586 states and 338667 transitions. [2019-09-10 06:04:29,480 INFO L78 Accepts]: Start accepts. Automaton has 220586 states and 338667 transitions. Word has length 98 [2019-09-10 06:04:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:29,480 INFO L475 AbstractCegarLoop]: Abstraction has 220586 states and 338667 transitions. [2019-09-10 06:04:29,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 220586 states and 338667 transitions. [2019-09-10 06:04:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:04:29,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:29,482 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:29,482 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:29,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:29,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1558655303, now seen corresponding path program 1 times [2019-09-10 06:04:29,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:29,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:29,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:04:29,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:29,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:04:29,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:04:29,612 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [125], [129], [151], [155], [177], [179], [182], [185], [188], [191], [194], [198], [206], [208], [211], [212], [214], [223], [226], [230], [235], [237], [240], [254], [258], [262], [264], [267], [292], [300], [308], [314], [318], [322], [324], [327], [352], [360], [368], [374], [378], [382], [384], [387], [412], [420], [428], [481], [492], [494], [505], [534], [535], [539], [540], [541] [2019-09-10 06:04:29,615 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:04:29,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:04:29,646 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:04:29,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:04:29,953 INFO L272 AbstractInterpreter]: Visited 91 different actions 537 times. Merged at 49 different actions 389 times. Widened at 26 different actions 68 times. Performed 1643 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1643 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 19 different actions. Largest state had 162 variables. [2019-09-10 06:04:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:29,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:04:29,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:29,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:04:29,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:29,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:04:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:30,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:04:30,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:04:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:04:30,136 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:04:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:04:30,205 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:04:30,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:04:30,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:30,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:30,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:30,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:04:30,206 INFO L87 Difference]: Start difference. First operand 220586 states and 338667 transitions. Second operand 4 states. [2019-09-10 06:04:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:31,649 INFO L93 Difference]: Finished difference Result 220588 states and 338664 transitions. [2019-09-10 06:04:31,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:04:31,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-10 06:04:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:31,932 INFO L225 Difference]: With dead ends: 220588 [2019-09-10 06:04:31,932 INFO L226 Difference]: Without dead ends: 220588 [2019-09-10 06:04:31,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:04:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220588 states. [2019-09-10 06:04:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220588 to 220476. [2019-09-10 06:04:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220476 states. [2019-09-10 06:04:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220476 states to 220476 states and 338528 transitions. [2019-09-10 06:04:38,501 INFO L78 Accepts]: Start accepts. Automaton has 220476 states and 338528 transitions. Word has length 98 [2019-09-10 06:04:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:38,501 INFO L475 AbstractCegarLoop]: Abstraction has 220476 states and 338528 transitions. [2019-09-10 06:04:38,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 220476 states and 338528 transitions. [2019-09-10 06:04:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:04:38,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:38,504 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:38,505 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:38,505 INFO L82 PathProgramCache]: Analyzing trace with hash -333337357, now seen corresponding path program 1 times [2019-09-10 06:04:38,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:38,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:38,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:38,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:38,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:04:38,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:04:38,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:04:38,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:38,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:04:38,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:04:38,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:38,550 INFO L87 Difference]: Start difference. First operand 220476 states and 338528 transitions. Second operand 3 states. [2019-09-10 06:04:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:39,553 INFO L93 Difference]: Finished difference Result 440894 states and 676969 transitions. [2019-09-10 06:04:39,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:04:39,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:04:39,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:40,138 INFO L225 Difference]: With dead ends: 440894 [2019-09-10 06:04:40,138 INFO L226 Difference]: Without dead ends: 440894 [2019-09-10 06:04:40,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:04:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440894 states. [2019-09-10 06:04:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440894 to 220480. [2019-09-10 06:04:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220480 states. [2019-09-10 06:04:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220480 states to 220480 states and 338532 transitions. [2019-09-10 06:04:44,149 INFO L78 Accepts]: Start accepts. Automaton has 220480 states and 338532 transitions. Word has length 99 [2019-09-10 06:04:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:44,904 INFO L475 AbstractCegarLoop]: Abstraction has 220480 states and 338532 transitions. [2019-09-10 06:04:44,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:04:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 220480 states and 338532 transitions. [2019-09-10 06:04:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:04:44,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:44,907 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:44,907 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1252570994, now seen corresponding path program 1 times [2019-09-10 06:04:44,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:44,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:44,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:04:45,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:45,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:04:45,020 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 06:04:45,020 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [18], [20], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [125], [129], [151], [155], [177], [179], [182], [185], [188], [191], [194], [198], [206], [208], [211], [212], [214], [223], [226], [230], [235], [237], [240], [254], [258], [262], [264], [267], [292], [300], [308], [314], [318], [322], [324], [327], [352], [360], [368], [374], [378], [382], [384], [387], [412], [420], [428], [468], [471], [477], [494], [497], [503], [534], [535], [539], [540], [541] [2019-09-10 06:04:45,023 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:04:45,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:04:45,047 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:04:45,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:04:45,305 INFO L272 AbstractInterpreter]: Visited 93 different actions 549 times. Merged at 49 different actions 398 times. Widened at 25 different actions 64 times. Performed 1679 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1679 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 15 different actions. Largest state had 162 variables. [2019-09-10 06:04:45,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:45,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:04:45,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:45,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:04:45,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:45,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:04:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:45,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:04:45,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:04:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:04:45,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:04:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:04:45,523 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:04:45,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:04:45,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:45,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:45,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:45,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:04:45,524 INFO L87 Difference]: Start difference. First operand 220480 states and 338532 transitions. Second operand 4 states. [2019-09-10 06:04:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:04:46,530 INFO L93 Difference]: Finished difference Result 427687 states and 651351 transitions. [2019-09-10 06:04:46,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:04:46,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-10 06:04:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:04:47,191 INFO L225 Difference]: With dead ends: 427687 [2019-09-10 06:04:47,192 INFO L226 Difference]: Without dead ends: 427687 [2019-09-10 06:04:47,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:04:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427687 states. [2019-09-10 06:04:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427687 to 427685. [2019-09-10 06:04:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427685 states. [2019-09-10 06:04:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427685 states to 427685 states and 651350 transitions. [2019-09-10 06:04:55,967 INFO L78 Accepts]: Start accepts. Automaton has 427685 states and 651350 transitions. Word has length 100 [2019-09-10 06:04:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:04:55,967 INFO L475 AbstractCegarLoop]: Abstraction has 427685 states and 651350 transitions. [2019-09-10 06:04:55,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:04:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 427685 states and 651350 transitions. [2019-09-10 06:04:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:04:55,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:04:55,970 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:04:55,970 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:04:55,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1637574090, now seen corresponding path program 1 times [2019-09-10 06:04:55,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:04:55,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:55,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:04:55,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:04:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:04:56,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:56,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:04:56,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 06:04:56,130 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [20], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [125], [129], [151], [155], [177], [179], [182], [185], [188], [191], [194], [198], [206], [208], [211], [212], [214], [223], [226], [230], [235], [237], [240], [254], [258], [262], [264], [267], [292], [300], [308], [314], [318], [322], [324], [327], [352], [360], [368], [374], [378], [382], [384], [387], [412], [420], [428], [468], [471], [477], [481], [492], [494], [505], [534], [535], [539], [540], [541] [2019-09-10 06:04:56,132 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:04:56,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:04:56,154 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:04:56,397 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:04:56,397 INFO L272 AbstractInterpreter]: Visited 93 different actions 580 times. Merged at 49 different actions 424 times. Widened at 25 different actions 72 times. Performed 1753 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1753 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 21 different actions. Largest state had 162 variables. [2019-09-10 06:04:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:04:56,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:04:56,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:04:56,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:04:56,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:04:56,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:04:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:04:56,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:04:56,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:04:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:04:56,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:04:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:04:56,628 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:04:56,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:04:56,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:04:56,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:04:56,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:04:56,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:04:56,632 INFO L87 Difference]: Start difference. First operand 427685 states and 651350 transitions. Second operand 4 states. [2019-09-10 06:05:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:05:04,000 INFO L93 Difference]: Finished difference Result 827801 states and 1247450 transitions. [2019-09-10 06:05:04,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:05:04,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-10 06:05:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:05:05,141 INFO L225 Difference]: With dead ends: 827801 [2019-09-10 06:05:05,141 INFO L226 Difference]: Without dead ends: 827801 [2019-09-10 06:05:05,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:05:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827801 states. [2019-09-10 06:05:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827801 to 827799. [2019-09-10 06:05:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827799 states. [2019-09-10 06:05:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827799 states to 827799 states and 1247449 transitions. [2019-09-10 06:05:33,794 INFO L78 Accepts]: Start accepts. Automaton has 827799 states and 1247449 transitions. Word has length 100 [2019-09-10 06:05:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:05:33,795 INFO L475 AbstractCegarLoop]: Abstraction has 827799 states and 1247449 transitions. [2019-09-10 06:05:33,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:05:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 827799 states and 1247449 transitions. [2019-09-10 06:05:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:05:33,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:05:33,799 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:05:33,799 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:05:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 860015290, now seen corresponding path program 1 times [2019-09-10 06:05:33,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:05:33,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:33,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:33,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:05:33,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:05:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:05:33,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:05:33,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:05:33,917 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 06:05:33,917 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [20], [25], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [125], [129], [151], [155], [177], [179], [182], [185], [188], [191], [194], [198], [206], [208], [211], [212], [214], [223], [226], [230], [235], [237], [240], [254], [258], [262], [264], [267], [292], [300], [308], [314], [318], [322], [324], [327], [352], [360], [368], [374], [378], [382], [384], [387], [412], [420], [428], [455], [466], [468], [479], [481], [492], [494], [505], [534], [535], [539], [540], [541] [2019-09-10 06:05:33,921 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:05:33,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:05:33,943 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:05:34,203 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:05:34,210 INFO L272 AbstractInterpreter]: Visited 93 different actions 553 times. Merged at 49 different actions 400 times. Widened at 26 different actions 68 times. Performed 1684 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 18 different actions. Largest state had 162 variables. [2019-09-10 06:05:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:05:34,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:05:34,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:05:34,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:05:34,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:05:34,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:05:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:05:34,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:05:34,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:05:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:05:34,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:05:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:05:34,417 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:05:34,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:05:34,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:05:34,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:05:34,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:05:34,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:05:34,423 INFO L87 Difference]: Start difference. First operand 827799 states and 1247449 transitions. Second operand 4 states. [2019-09-10 06:05:45,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:05:45,453 INFO L93 Difference]: Finished difference Result 1601849 states and 2390883 transitions. [2019-09-10 06:05:45,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:05:45,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-10 06:05:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:05:49,261 INFO L225 Difference]: With dead ends: 1601849 [2019-09-10 06:05:49,262 INFO L226 Difference]: Without dead ends: 1601849 [2019-09-10 06:05:49,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:05:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601849 states. [2019-09-10 06:06:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601849 to 1601847. [2019-09-10 06:06:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601847 states.