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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:51,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:51,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:51,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:51,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:51,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:51,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:51,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:51,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:51,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:51,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:51,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:51,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:52,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:52,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:52,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:52,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:52,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:52,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:52,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:52,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:52,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:52,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:52,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:52,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:52,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:52,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:52,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:52,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:52,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:52,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:52,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:52,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:52,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:52,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:52,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:52,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:52,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:52,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:52,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:52,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:52,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:22:52,068 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:52,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:52,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:52,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:52,070 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:52,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:52,071 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:52,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:52,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:52,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:52,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:52,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:52,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:52,072 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:52,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:52,072 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:52,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:52,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:52,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:52,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:52,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:52,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:52,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:52,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:52,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:52,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:52,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:52,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:52,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:22:52,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:52,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:52,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:52,361 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:52,362 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:52,362 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:22:52,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/548627f53/518b02dfce684856a534ecc9a9d43ad5/FLAGa912837cd [2019-10-15 01:22:52,972 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:52,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:22:52,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/548627f53/518b02dfce684856a534ecc9a9d43ad5/FLAGa912837cd [2019-10-15 01:22:53,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/548627f53/518b02dfce684856a534ecc9a9d43ad5 [2019-10-15 01:22:53,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:53,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:53,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:53,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:53,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:53,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:53" (1/1) ... [2019-10-15 01:22:53,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2fb7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:53, skipping insertion in model container [2019-10-15 01:22:53,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:53" (1/1) ... [2019-10-15 01:22:53,283 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:53,361 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:53,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:53,922 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:54,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:54,098 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:54,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54 WrapperNode [2019-10-15 01:22:54,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:54,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:54,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:54,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:54,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54" (1/1) ... [2019-10-15 01:22:54,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54" (1/1) ... [2019-10-15 01:22:54,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54" (1/1) ... [2019-10-15 01:22:54,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54" (1/1) ... [2019-10-15 01:22:54,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54" (1/1) ... [2019-10-15 01:22:54,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54" (1/1) ... [2019-10-15 01:22:54,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54" (1/1) ... [2019-10-15 01:22:54,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:54,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:54,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:54,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:54,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54" (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-10-15 01:22:54,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:54,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:54,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:54,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:54,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:54,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:22:54,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:54,335 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:54,336 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:55,819 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:55,819 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:55,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:55 BoogieIcfgContainer [2019-10-15 01:22:55,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:55,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:55,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:55,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:55,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:53" (1/3) ... [2019-10-15 01:22:55,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce1bc45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:55, skipping insertion in model container [2019-10-15 01:22:55,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54" (2/3) ... [2019-10-15 01:22:55,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce1bc45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:55, skipping insertion in model container [2019-10-15 01:22:55,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:55" (3/3) ... [2019-10-15 01:22:55,834 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:22:55,845 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:55,869 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:55,878 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:55,908 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:55,909 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:55,909 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:55,909 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:55,909 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:55,910 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:55,910 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:55,910 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states. [2019-10-15 01:22:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:22:55,951 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:55,952 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:55,954 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1464169863, now seen corresponding path program 1 times [2019-10-15 01:22:55,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:55,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660431758] [2019-10-15 01:22:55,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:56,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660431758] [2019-10-15 01:22:56,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:56,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:56,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343121322] [2019-10-15 01:22:56,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:56,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:56,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:56,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:56,623 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 3 states. [2019-10-15 01:22:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:56,895 INFO L93 Difference]: Finished difference Result 619 states and 1086 transitions. [2019-10-15 01:22:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:56,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-15 01:22:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:56,931 INFO L225 Difference]: With dead ends: 619 [2019-10-15 01:22:56,931 INFO L226 Difference]: Without dead ends: 492 [2019-10-15 01:22:56,940 INFO L600 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-10-15 01:22:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-15 01:22:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2019-10-15 01:22:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-15 01:22:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 727 transitions. [2019-10-15 01:22:57,103 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 727 transitions. Word has length 147 [2019-10-15 01:22:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:57,105 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 727 transitions. [2019-10-15 01:22:57,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 727 transitions. [2019-10-15 01:22:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:22:57,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:57,116 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:57,117 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash 558735771, now seen corresponding path program 1 times [2019-10-15 01:22:57,119 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:57,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469706959] [2019-10-15 01:22:57,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:57,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469706959] [2019-10-15 01:22:57,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:57,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:57,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735348822] [2019-10-15 01:22:57,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:57,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:57,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:57,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:57,339 INFO L87 Difference]: Start difference. First operand 490 states and 727 transitions. Second operand 3 states. [2019-10-15 01:22:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:57,465 INFO L93 Difference]: Finished difference Result 1032 states and 1578 transitions. [2019-10-15 01:22:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:57,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-15 01:22:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:57,472 INFO L225 Difference]: With dead ends: 1032 [2019-10-15 01:22:57,473 INFO L226 Difference]: Without dead ends: 840 [2019-10-15 01:22:57,477 INFO L600 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-10-15 01:22:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-10-15 01:22:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2019-10-15 01:22:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-15 01:22:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1255 transitions. [2019-10-15 01:22:57,528 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1255 transitions. Word has length 147 [2019-10-15 01:22:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:57,529 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1255 transitions. [2019-10-15 01:22:57,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1255 transitions. [2019-10-15 01:22:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:22:57,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:57,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:57,534 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:57,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1754446721, now seen corresponding path program 1 times [2019-10-15 01:22:57,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:57,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370784828] [2019-10-15 01:22:57,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:57,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370784828] [2019-10-15 01:22:57,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:57,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:57,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180029867] [2019-10-15 01:22:57,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:57,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:57,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:57,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:57,935 INFO L87 Difference]: Start difference. First operand 838 states and 1255 transitions. Second operand 4 states. [2019-10-15 01:22:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:58,084 INFO L93 Difference]: Finished difference Result 2461 states and 3682 transitions. [2019-10-15 01:22:58,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:58,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-15 01:22:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:58,094 INFO L225 Difference]: With dead ends: 2461 [2019-10-15 01:22:58,094 INFO L226 Difference]: Without dead ends: 1636 [2019-10-15 01:22:58,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-15 01:22:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-10-15 01:22:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1634. [2019-10-15 01:22:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-10-15 01:22:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2428 transitions. [2019-10-15 01:22:58,189 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2428 transitions. Word has length 147 [2019-10-15 01:22:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,189 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 2428 transitions. [2019-10-15 01:22:58,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2428 transitions. [2019-10-15 01:22:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:22:58,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,194 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:58,195 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash 818598479, now seen corresponding path program 1 times [2019-10-15 01:22:58,196 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100588429] [2019-10-15 01:22:58,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:58,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100588429] [2019-10-15 01:22:58,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:58,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903906703] [2019-10-15 01:22:58,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:58,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:58,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:58,300 INFO L87 Difference]: Start difference. First operand 1634 states and 2428 transitions. Second operand 3 states. [2019-10-15 01:22:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:58,447 INFO L93 Difference]: Finished difference Result 4856 states and 7214 transitions. [2019-10-15 01:22:58,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:58,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-15 01:22:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:58,470 INFO L225 Difference]: With dead ends: 4856 [2019-10-15 01:22:58,470 INFO L226 Difference]: Without dead ends: 3254 [2019-10-15 01:22:58,475 INFO L600 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-10-15 01:22:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-10-15 01:22:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 1636. [2019-10-15 01:22:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-10-15 01:22:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2430 transitions. [2019-10-15 01:22:58,597 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2430 transitions. Word has length 148 [2019-10-15 01:22:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,597 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 2430 transitions. [2019-10-15 01:22:58,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2430 transitions. [2019-10-15 01:22:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:22:58,601 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,602 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:58,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,602 INFO L82 PathProgramCache]: Analyzing trace with hash -77658400, now seen corresponding path program 1 times [2019-10-15 01:22:58,603 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532060397] [2019-10-15 01:22:58,603 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:58,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532060397] [2019-10-15 01:22:58,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:58,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409969086] [2019-10-15 01:22:58,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:58,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:58,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:58,855 INFO L87 Difference]: Start difference. First operand 1636 states and 2430 transitions. Second operand 4 states. [2019-10-15 01:22:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:59,091 INFO L93 Difference]: Finished difference Result 3258 states and 4842 transitions. [2019-10-15 01:22:59,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:59,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-15 01:22:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:59,104 INFO L225 Difference]: With dead ends: 3258 [2019-10-15 01:22:59,104 INFO L226 Difference]: Without dead ends: 1634 [2019-10-15 01:22:59,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-10-15 01:22:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2019-10-15 01:22:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-10-15 01:22:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2426 transitions. [2019-10-15 01:22:59,237 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2426 transitions. Word has length 149 [2019-10-15 01:22:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:59,239 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 2426 transitions. [2019-10-15 01:22:59,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2426 transitions. [2019-10-15 01:22:59,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:22:59,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:59,245 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:59,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:59,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:59,246 INFO L82 PathProgramCache]: Analyzing trace with hash -381277494, now seen corresponding path program 1 times [2019-10-15 01:22:59,247 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:59,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808880762] [2019-10-15 01:22:59,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:59,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808880762] [2019-10-15 01:22:59,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:59,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:59,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661466308] [2019-10-15 01:22:59,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:59,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:59,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:59,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:59,443 INFO L87 Difference]: Start difference. First operand 1634 states and 2426 transitions. Second operand 3 states. [2019-10-15 01:22:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:59,611 INFO L93 Difference]: Finished difference Result 3870 states and 5761 transitions. [2019-10-15 01:22:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:59,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:22:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:59,625 INFO L225 Difference]: With dead ends: 3870 [2019-10-15 01:22:59,625 INFO L226 Difference]: Without dead ends: 2414 [2019-10-15 01:22:59,629 INFO L600 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-10-15 01:22:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-10-15 01:22:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2412. [2019-10-15 01:22:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-10-15 01:22:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3535 transitions. [2019-10-15 01:22:59,893 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3535 transitions. Word has length 149 [2019-10-15 01:22:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:59,893 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 3535 transitions. [2019-10-15 01:22:59,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3535 transitions. [2019-10-15 01:22:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:22:59,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:59,901 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:59,902 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:59,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1397721559, now seen corresponding path program 1 times [2019-10-15 01:22:59,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:59,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599514335] [2019-10-15 01:22:59,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:00,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599514335] [2019-10-15 01:23:00,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:00,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:00,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928364268] [2019-10-15 01:23:00,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:00,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:00,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:00,128 INFO L87 Difference]: Start difference. First operand 2412 states and 3535 transitions. Second operand 5 states. [2019-10-15 01:23:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:00,636 INFO L93 Difference]: Finished difference Result 4658 states and 6855 transitions. [2019-10-15 01:23:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:00,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-15 01:23:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:00,649 INFO L225 Difference]: With dead ends: 4658 [2019-10-15 01:23:00,650 INFO L226 Difference]: Without dead ends: 2414 [2019-10-15 01:23:00,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-10-15 01:23:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2412. [2019-10-15 01:23:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-10-15 01:23:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3520 transitions. [2019-10-15 01:23:00,818 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3520 transitions. Word has length 152 [2019-10-15 01:23:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:00,819 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 3520 transitions. [2019-10-15 01:23:00,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3520 transitions. [2019-10-15 01:23:00,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:23:00,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:00,827 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:00,827 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1633318332, now seen corresponding path program 1 times [2019-10-15 01:23:00,828 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:00,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377947955] [2019-10-15 01:23:00,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:00,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:00,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:01,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377947955] [2019-10-15 01:23:01,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:01,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:01,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324382638] [2019-10-15 01:23:01,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:01,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:01,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:01,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:01,126 INFO L87 Difference]: Start difference. First operand 2412 states and 3520 transitions. Second operand 4 states. [2019-10-15 01:23:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:01,455 INFO L93 Difference]: Finished difference Result 6242 states and 9103 transitions. [2019-10-15 01:23:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:01,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-15 01:23:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,480 INFO L225 Difference]: With dead ends: 6242 [2019-10-15 01:23:01,480 INFO L226 Difference]: Without dead ends: 3853 [2019-10-15 01:23:01,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-15 01:23:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-10-15 01:23:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2019-10-15 01:23:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3851 states. [2019-10-15 01:23:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5567 transitions. [2019-10-15 01:23:01,837 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5567 transitions. Word has length 152 [2019-10-15 01:23:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:01,837 INFO L462 AbstractCegarLoop]: Abstraction has 3851 states and 5567 transitions. [2019-10-15 01:23:01,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5567 transitions. [2019-10-15 01:23:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:01,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:01,844 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:01,844 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash -83620211, now seen corresponding path program 1 times [2019-10-15 01:23:01,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:01,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017244632] [2019-10-15 01:23:01,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:01,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017244632] [2019-10-15 01:23:01,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:01,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:01,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748358087] [2019-10-15 01:23:01,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:01,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:01,981 INFO L87 Difference]: Start difference. First operand 3851 states and 5567 transitions. Second operand 3 states. [2019-10-15 01:23:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:02,379 INFO L93 Difference]: Finished difference Result 10239 states and 14831 transitions. [2019-10-15 01:23:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:02,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-15 01:23:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:02,413 INFO L225 Difference]: With dead ends: 10239 [2019-10-15 01:23:02,413 INFO L226 Difference]: Without dead ends: 6731 [2019-10-15 01:23:02,422 INFO L600 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-10-15 01:23:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6731 states. [2019-10-15 01:23:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6731 to 6729. [2019-10-15 01:23:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2019-10-15 01:23:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 9603 transitions. [2019-10-15 01:23:02,871 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 9603 transitions. Word has length 154 [2019-10-15 01:23:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:02,872 INFO L462 AbstractCegarLoop]: Abstraction has 6729 states and 9603 transitions. [2019-10-15 01:23:02,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 9603 transitions. [2019-10-15 01:23:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:02,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:02,882 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:02,883 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:02,885 INFO L82 PathProgramCache]: Analyzing trace with hash 423811114, now seen corresponding path program 1 times [2019-10-15 01:23:02,886 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:02,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115514624] [2019-10-15 01:23:02,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:03,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115514624] [2019-10-15 01:23:03,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:03,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:03,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945447188] [2019-10-15 01:23:03,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:03,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:03,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:03,054 INFO L87 Difference]: Start difference. First operand 6729 states and 9603 transitions. Second operand 4 states. [2019-10-15 01:23:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:03,401 INFO L93 Difference]: Finished difference Result 11002 states and 15732 transitions. [2019-10-15 01:23:03,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:03,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-15 01:23:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:03,455 INFO L225 Difference]: With dead ends: 11002 [2019-10-15 01:23:03,455 INFO L226 Difference]: Without dead ends: 5964 [2019-10-15 01:23:03,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-10-15 01:23:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5964. [2019-10-15 01:23:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2019-10-15 01:23:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 8508 transitions. [2019-10-15 01:23:03,903 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 8508 transitions. Word has length 154 [2019-10-15 01:23:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:03,903 INFO L462 AbstractCegarLoop]: Abstraction has 5964 states and 8508 transitions. [2019-10-15 01:23:03,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 8508 transitions. [2019-10-15 01:23:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:23:03,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:03,913 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:03,913 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:03,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:03,914 INFO L82 PathProgramCache]: Analyzing trace with hash 923876710, now seen corresponding path program 1 times [2019-10-15 01:23:03,914 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:03,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699344734] [2019-10-15 01:23:03,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:03,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:03,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:04,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699344734] [2019-10-15 01:23:04,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:04,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:04,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169262537] [2019-10-15 01:23:04,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:04,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:04,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:04,101 INFO L87 Difference]: Start difference. First operand 5964 states and 8508 transitions. Second operand 4 states. [2019-10-15 01:23:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:04,771 INFO L93 Difference]: Finished difference Result 17410 states and 24777 transitions. [2019-10-15 01:23:04,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:04,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-15 01:23:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:04,796 INFO L225 Difference]: With dead ends: 17410 [2019-10-15 01:23:04,796 INFO L226 Difference]: Without dead ends: 11489 [2019-10-15 01:23:04,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-15 01:23:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11489 states. [2019-10-15 01:23:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11489 to 11487. [2019-10-15 01:23:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11487 states. [2019-10-15 01:23:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 16184 transitions. [2019-10-15 01:23:05,458 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 16184 transitions. Word has length 157 [2019-10-15 01:23:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:05,458 INFO L462 AbstractCegarLoop]: Abstraction has 11487 states and 16184 transitions. [2019-10-15 01:23:05,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 16184 transitions. [2019-10-15 01:23:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:23:05,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:05,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:05,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:05,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2109819854, now seen corresponding path program 1 times [2019-10-15 01:23:05,474 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:05,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764370653] [2019-10-15 01:23:05,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:05,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764370653] [2019-10-15 01:23:05,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:05,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:05,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124050622] [2019-10-15 01:23:05,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:05,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:05,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:05,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:05,596 INFO L87 Difference]: Start difference. First operand 11487 states and 16184 transitions. Second operand 3 states. [2019-10-15 01:23:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:06,775 INFO L93 Difference]: Finished difference Result 34269 states and 48305 transitions. [2019-10-15 01:23:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:06,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-15 01:23:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:06,848 INFO L225 Difference]: With dead ends: 34269 [2019-10-15 01:23:06,848 INFO L226 Difference]: Without dead ends: 22887 [2019-10-15 01:23:06,883 INFO L600 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-10-15 01:23:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22887 states. [2019-10-15 01:23:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22887 to 11493. [2019-10-15 01:23:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11493 states. [2019-10-15 01:23:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11493 states to 11493 states and 16190 transitions. [2019-10-15 01:23:07,793 INFO L78 Accepts]: Start accepts. Automaton has 11493 states and 16190 transitions. Word has length 158 [2019-10-15 01:23:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:07,793 INFO L462 AbstractCegarLoop]: Abstraction has 11493 states and 16190 transitions. [2019-10-15 01:23:07,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 11493 states and 16190 transitions. [2019-10-15 01:23:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:23:07,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:07,809 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:07,809 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:07,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1177749259, now seen corresponding path program 1 times [2019-10-15 01:23:07,810 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:07,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860311517] [2019-10-15 01:23:07,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:07,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860311517] [2019-10-15 01:23:07,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:07,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:07,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011418013] [2019-10-15 01:23:07,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:07,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:07,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:07,928 INFO L87 Difference]: Start difference. First operand 11493 states and 16190 transitions. Second operand 3 states. [2019-10-15 01:23:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:08,831 INFO L93 Difference]: Finished difference Result 30661 states and 43120 transitions. [2019-10-15 01:23:08,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:08,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-15 01:23:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:08,871 INFO L225 Difference]: With dead ends: 30661 [2019-10-15 01:23:08,872 INFO L226 Difference]: Without dead ends: 19849 [2019-10-15 01:23:08,896 INFO L600 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-10-15 01:23:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19849 states. [2019-10-15 01:23:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19849 to 19847. [2019-10-15 01:23:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19847 states. [2019-10-15 01:23:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19847 states to 19847 states and 27468 transitions. [2019-10-15 01:23:10,406 INFO L78 Accepts]: Start accepts. Automaton has 19847 states and 27468 transitions. Word has length 159 [2019-10-15 01:23:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:10,406 INFO L462 AbstractCegarLoop]: Abstraction has 19847 states and 27468 transitions. [2019-10-15 01:23:10,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 19847 states and 27468 transitions. [2019-10-15 01:23:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:23:10,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:10,432 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:10,432 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash -220529586, now seen corresponding path program 1 times [2019-10-15 01:23:10,433 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:10,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416355946] [2019-10-15 01:23:10,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:10,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416355946] [2019-10-15 01:23:10,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:10,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:10,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455713164] [2019-10-15 01:23:10,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:10,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:10,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:10,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:10,578 INFO L87 Difference]: Start difference. First operand 19847 states and 27468 transitions. Second operand 4 states. [2019-10-15 01:23:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:11,625 INFO L93 Difference]: Finished difference Result 36277 states and 50352 transitions. [2019-10-15 01:23:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:11,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-15 01:23:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:11,657 INFO L225 Difference]: With dead ends: 36277 [2019-10-15 01:23:11,657 INFO L226 Difference]: Without dead ends: 17049 [2019-10-15 01:23:11,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17049 states. [2019-10-15 01:23:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17049 to 17049. [2019-10-15 01:23:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17049 states. [2019-10-15 01:23:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17049 states to 17049 states and 23607 transitions. [2019-10-15 01:23:12,360 INFO L78 Accepts]: Start accepts. Automaton has 17049 states and 23607 transitions. Word has length 159 [2019-10-15 01:23:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:12,360 INFO L462 AbstractCegarLoop]: Abstraction has 17049 states and 23607 transitions. [2019-10-15 01:23:12,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17049 states and 23607 transitions. [2019-10-15 01:23:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-15 01:23:12,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:12,381 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:12,381 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash -888345886, now seen corresponding path program 1 times [2019-10-15 01:23:12,382 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:12,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218796426] [2019-10-15 01:23:12,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:12,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218796426] [2019-10-15 01:23:12,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:12,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:12,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851016887] [2019-10-15 01:23:12,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:12,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:12,548 INFO L87 Difference]: Start difference. First operand 17049 states and 23607 transitions. Second operand 5 states. [2019-10-15 01:23:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:14,244 INFO L93 Difference]: Finished difference Result 47742 states and 66753 transitions. [2019-10-15 01:23:14,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:14,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-15 01:23:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:14,301 INFO L225 Difference]: With dead ends: 47742 [2019-10-15 01:23:14,301 INFO L226 Difference]: Without dead ends: 32329 [2019-10-15 01:23:14,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32329 states. [2019-10-15 01:23:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32329 to 32327. [2019-10-15 01:23:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32327 states. [2019-10-15 01:23:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32327 states to 32327 states and 44631 transitions. [2019-10-15 01:23:15,740 INFO L78 Accepts]: Start accepts. Automaton has 32327 states and 44631 transitions. Word has length 165 [2019-10-15 01:23:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:15,741 INFO L462 AbstractCegarLoop]: Abstraction has 32327 states and 44631 transitions. [2019-10-15 01:23:15,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 32327 states and 44631 transitions. [2019-10-15 01:23:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-15 01:23:15,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:15,785 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:15,786 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:15,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:15,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1990153662, now seen corresponding path program 1 times [2019-10-15 01:23:15,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:15,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101687848] [2019-10-15 01:23:15,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:16,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101687848] [2019-10-15 01:23:16,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:16,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:16,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717408445] [2019-10-15 01:23:16,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:16,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:16,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:16,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:16,643 INFO L87 Difference]: Start difference. First operand 32327 states and 44631 transitions. Second operand 6 states. [2019-10-15 01:23:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:19,238 INFO L93 Difference]: Finished difference Result 74095 states and 110339 transitions. [2019-10-15 01:23:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:19,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-10-15 01:23:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:19,328 INFO L225 Difference]: With dead ends: 74095 [2019-10-15 01:23:19,328 INFO L226 Difference]: Without dead ends: 60045 [2019-10-15 01:23:19,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60045 states. [2019-10-15 01:23:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60045 to 59751. [2019-10-15 01:23:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59751 states. [2019-10-15 01:23:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59751 states to 59751 states and 87443 transitions. [2019-10-15 01:23:22,237 INFO L78 Accepts]: Start accepts. Automaton has 59751 states and 87443 transitions. Word has length 165 [2019-10-15 01:23:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:22,238 INFO L462 AbstractCegarLoop]: Abstraction has 59751 states and 87443 transitions. [2019-10-15 01:23:22,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 59751 states and 87443 transitions. [2019-10-15 01:23:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-15 01:23:22,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:22,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:22,260 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash -794442712, now seen corresponding path program 1 times [2019-10-15 01:23:22,261 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:22,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273448748] [2019-10-15 01:23:22,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:22,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273448748] [2019-10-15 01:23:22,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:22,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:22,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196891016] [2019-10-15 01:23:22,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:22,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:22,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:22,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:22,463 INFO L87 Difference]: Start difference. First operand 59751 states and 87443 transitions. Second operand 4 states.