/usr/bin/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/ssh-simplified/s3_srvr_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:13:32,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:13:32,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:13:32,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:13:32,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:13:32,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:13:32,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:13:32,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:13:32,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:13:32,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:13:32,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:13:32,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:13:32,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:13:32,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:13:32,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:13:32,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:13:32,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:13:32,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:13:32,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:13:32,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:13:32,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:13:32,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:13:32,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:13:32,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:13:32,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:13:32,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:13:32,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:13:32,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:13:32,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:13:32,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:13:32,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:13:32,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:13:32,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:13:32,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:13:32,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:13:32,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:13:32,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:13:32,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:13:32,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:13:32,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:13:32,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:13:32,990 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-11-07 01:13:33,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:13:33,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:13:33,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:13:33,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:13:33,007 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:13:33,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:13:33,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:13:33,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:13:33,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:13:33,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:13:33,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:13:33,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:13:33,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:13:33,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:13:33,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:13:33,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:13:33,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:13:33,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:13:33,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:13:33,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:13:33,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:13:33,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:13:33,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:13:33,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:13:33,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:13:33,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:13:33,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:13:33,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:13:33,012 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-11-07 01:13:33,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:13:33,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:13:33,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:13:33,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:13:33,307 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:13:33,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-07 01:13:33,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc785736/d0dfd1a3d7e94af391d8809b570243a0/FLAGb022f5088 [2019-11-07 01:13:33,903 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:13:33,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-07 01:13:33,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc785736/d0dfd1a3d7e94af391d8809b570243a0/FLAGb022f5088 [2019-11-07 01:13:34,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc785736/d0dfd1a3d7e94af391d8809b570243a0 [2019-11-07 01:13:34,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:13:34,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:13:34,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:34,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:13:34,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:13:34,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:34" (1/1) ... [2019-11-07 01:13:34,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a879e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34, skipping insertion in model container [2019-11-07 01:13:34,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:34" (1/1) ... [2019-11-07 01:13:34,247 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:13:34,303 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:13:34,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:34,657 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:13:34,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:34,836 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:13:34,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34 WrapperNode [2019-11-07 01:13:34,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:34,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:13:34,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:13:34,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:13:34,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34" (1/1) ... [2019-11-07 01:13:34,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34" (1/1) ... [2019-11-07 01:13:34,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34" (1/1) ... [2019-11-07 01:13:34,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34" (1/1) ... [2019-11-07 01:13:34,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34" (1/1) ... [2019-11-07 01:13:34,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34" (1/1) ... [2019-11-07 01:13:34,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34" (1/1) ... [2019-11-07 01:13:34,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:13:34,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:13:34,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:13:34,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:13:34,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34" (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-11-07 01:13:34,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:13:34,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:13:34,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-11-07 01:13:34,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR [2019-11-07 01:13:35,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:13:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:13:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:13:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:13:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 01:13:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 01:13:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ERR [2019-11-07 01:13:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-11-07 01:13:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:13:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:13:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:13:35,262 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 01:13:35,834 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-07 01:13:35,834 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-07 01:13:35,839 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:13:35,842 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:13:35,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:35 BoogieIcfgContainer [2019-11-07 01:13:35,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:13:35,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:13:35,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:13:35,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:13:35,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:13:34" (1/3) ... [2019-11-07 01:13:35,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a913a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:35, skipping insertion in model container [2019-11-07 01:13:35,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:34" (2/3) ... [2019-11-07 01:13:35,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a913a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:35, skipping insertion in model container [2019-11-07 01:13:35,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:35" (3/3) ... [2019-11-07 01:13:35,866 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-11-07 01:13:35,877 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:13:35,883 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:13:35,894 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:13:35,928 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:13:35,929 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:13:35,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:13:35,929 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:13:35,929 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:13:35,930 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:13:35,930 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:13:35,930 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:13:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-11-07 01:13:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 01:13:35,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:35,971 INFO L410 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] [2019-11-07 01:13:35,973 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:35,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1696698376, now seen corresponding path program 1 times [2019-11-07 01:13:35,986 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:35,986 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531838248] [2019-11-07 01:13:35,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:36,310 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531838248] [2019-11-07 01:13:36,312 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:36,312 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:36,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880519039] [2019-11-07 01:13:36,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:36,324 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:36,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:36,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:36,344 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-11-07 01:13:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:36,833 INFO L93 Difference]: Finished difference Result 345 states and 585 transitions. [2019-11-07 01:13:36,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:36,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-07 01:13:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:36,860 INFO L225 Difference]: With dead ends: 345 [2019-11-07 01:13:36,860 INFO L226 Difference]: Without dead ends: 183 [2019-11-07 01:13:36,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-07 01:13:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2019-11-07 01:13:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-07 01:13:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 284 transitions. [2019-11-07 01:13:36,935 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 284 transitions. Word has length 51 [2019-11-07 01:13:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:36,936 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 284 transitions. [2019-11-07 01:13:36,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 284 transitions. [2019-11-07 01:13:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 01:13:36,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:36,940 INFO L410 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] [2019-11-07 01:13:36,940 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:36,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 742008338, now seen corresponding path program 1 times [2019-11-07 01:13:36,941 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:36,941 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599267149] [2019-11-07 01:13:36,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:37,088 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599267149] [2019-11-07 01:13:37,088 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:37,088 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:37,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128058824] [2019-11-07 01:13:37,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:37,092 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:37,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:37,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:37,094 INFO L87 Difference]: Start difference. First operand 178 states and 284 transitions. Second operand 5 states. [2019-11-07 01:13:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:37,441 INFO L93 Difference]: Finished difference Result 391 states and 639 transitions. [2019-11-07 01:13:37,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:37,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-07 01:13:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:37,446 INFO L225 Difference]: With dead ends: 391 [2019-11-07 01:13:37,446 INFO L226 Difference]: Without dead ends: 224 [2019-11-07 01:13:37,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-07 01:13:37,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2019-11-07 01:13:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-07 01:13:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 361 transitions. [2019-11-07 01:13:37,499 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 361 transitions. Word has length 52 [2019-11-07 01:13:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:37,500 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 361 transitions. [2019-11-07 01:13:37,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 361 transitions. [2019-11-07 01:13:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-07 01:13:37,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:37,513 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:37,513 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:37,513 INFO L82 PathProgramCache]: Analyzing trace with hash 201696029, now seen corresponding path program 1 times [2019-11-07 01:13:37,516 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:37,516 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898567142] [2019-11-07 01:13:37,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:37,682 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898567142] [2019-11-07 01:13:37,683 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:37,683 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:37,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857503005] [2019-11-07 01:13:37,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:37,684 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:37,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:37,685 INFO L87 Difference]: Start difference. First operand 219 states and 361 transitions. Second operand 5 states. [2019-11-07 01:13:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:37,952 INFO L93 Difference]: Finished difference Result 456 states and 763 transitions. [2019-11-07 01:13:37,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:37,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-07 01:13:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:37,956 INFO L225 Difference]: With dead ends: 456 [2019-11-07 01:13:37,957 INFO L226 Difference]: Without dead ends: 250 [2019-11-07 01:13:37,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-07 01:13:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-11-07 01:13:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-07 01:13:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 417 transitions. [2019-11-07 01:13:38,002 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 417 transitions. Word has length 80 [2019-11-07 01:13:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:38,002 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 417 transitions. [2019-11-07 01:13:38,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 417 transitions. [2019-11-07 01:13:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-07 01:13:38,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:38,008 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:38,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:38,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:38,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1556256498, now seen corresponding path program 1 times [2019-11-07 01:13:38,012 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:38,012 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955230086] [2019-11-07 01:13:38,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:38,161 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955230086] [2019-11-07 01:13:38,161 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:38,161 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:38,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612360487] [2019-11-07 01:13:38,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:38,163 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:38,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:38,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:38,164 INFO L87 Difference]: Start difference. First operand 250 states and 417 transitions. Second operand 5 states. [2019-11-07 01:13:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:38,394 INFO L93 Difference]: Finished difference Result 533 states and 899 transitions. [2019-11-07 01:13:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:38,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-11-07 01:13:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:38,397 INFO L225 Difference]: With dead ends: 533 [2019-11-07 01:13:38,398 INFO L226 Difference]: Without dead ends: 296 [2019-11-07 01:13:38,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-07 01:13:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-07 01:13:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-07 01:13:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-11-07 01:13:38,413 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 91 [2019-11-07 01:13:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:38,413 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-11-07 01:13:38,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-11-07 01:13:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 01:13:38,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:38,416 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:38,416 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1933322156, now seen corresponding path program 1 times [2019-11-07 01:13:38,417 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:38,417 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548189714] [2019-11-07 01:13:38,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:38,505 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548189714] [2019-11-07 01:13:38,505 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:38,505 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:38,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761447776] [2019-11-07 01:13:38,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:38,506 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:38,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:38,507 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 5 states. [2019-11-07 01:13:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:38,745 INFO L93 Difference]: Finished difference Result 575 states and 972 transitions. [2019-11-07 01:13:38,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:38,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-11-07 01:13:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:38,749 INFO L225 Difference]: With dead ends: 575 [2019-11-07 01:13:38,749 INFO L226 Difference]: Without dead ends: 294 [2019-11-07 01:13:38,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-07 01:13:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2019-11-07 01:13:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-07 01:13:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 487 transitions. [2019-11-07 01:13:38,763 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 487 transitions. Word has length 92 [2019-11-07 01:13:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:38,764 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 487 transitions. [2019-11-07 01:13:38,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 487 transitions. [2019-11-07 01:13:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 01:13:38,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:38,766 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:38,766 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1585840345, now seen corresponding path program 1 times [2019-11-07 01:13:38,767 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:38,767 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384719922] [2019-11-07 01:13:38,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:13:38,823 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384719922] [2019-11-07 01:13:38,823 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:38,823 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:38,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115345753] [2019-11-07 01:13:38,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:38,824 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:38,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:38,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:38,825 INFO L87 Difference]: Start difference. First operand 290 states and 487 transitions. Second operand 5 states. [2019-11-07 01:13:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:38,997 INFO L93 Difference]: Finished difference Result 584 states and 985 transitions. [2019-11-07 01:13:38,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:38,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-11-07 01:13:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:38,999 INFO L225 Difference]: With dead ends: 584 [2019-11-07 01:13:39,000 INFO L226 Difference]: Without dead ends: 307 [2019-11-07 01:13:39,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-07 01:13:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-11-07 01:13:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-07 01:13:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 509 transitions. [2019-11-07 01:13:39,015 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 509 transitions. Word has length 92 [2019-11-07 01:13:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:39,015 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 509 transitions. [2019-11-07 01:13:39,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 509 transitions. [2019-11-07 01:13:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-07 01:13:39,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:39,017 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:39,017 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:39,018 INFO L82 PathProgramCache]: Analyzing trace with hash 6376232, now seen corresponding path program 1 times [2019-11-07 01:13:39,018 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:39,018 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603934848] [2019-11-07 01:13:39,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:13:39,100 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603934848] [2019-11-07 01:13:39,100 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:39,100 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:39,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141834333] [2019-11-07 01:13:39,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:39,101 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:39,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:39,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:39,102 INFO L87 Difference]: Start difference. First operand 305 states and 509 transitions. Second operand 5 states. [2019-11-07 01:13:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:39,293 INFO L93 Difference]: Finished difference Result 599 states and 1003 transitions. [2019-11-07 01:13:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:39,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-07 01:13:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:39,297 INFO L225 Difference]: With dead ends: 599 [2019-11-07 01:13:39,297 INFO L226 Difference]: Without dead ends: 307 [2019-11-07 01:13:39,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-07 01:13:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-11-07 01:13:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-07 01:13:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 505 transitions. [2019-11-07 01:13:39,314 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 505 transitions. Word has length 93 [2019-11-07 01:13:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:39,315 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 505 transitions. [2019-11-07 01:13:39,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 505 transitions. [2019-11-07 01:13:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:13:39,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:39,317 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:39,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash -854791455, now seen corresponding path program 1 times [2019-11-07 01:13:39,318 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:39,318 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166549136] [2019-11-07 01:13:39,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-07 01:13:39,394 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166549136] [2019-11-07 01:13:39,394 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:39,394 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:39,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410988399] [2019-11-07 01:13:39,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:39,396 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:39,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:39,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:39,397 INFO L87 Difference]: Start difference. First operand 305 states and 505 transitions. Second operand 5 states. [2019-11-07 01:13:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:39,579 INFO L93 Difference]: Finished difference Result 606 states and 1005 transitions. [2019-11-07 01:13:39,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:39,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-07 01:13:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:39,582 INFO L225 Difference]: With dead ends: 606 [2019-11-07 01:13:39,583 INFO L226 Difference]: Without dead ends: 314 [2019-11-07 01:13:39,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-07 01:13:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-11-07 01:13:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-07 01:13:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 511 transitions. [2019-11-07 01:13:39,601 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 511 transitions. Word has length 106 [2019-11-07 01:13:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:39,601 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 511 transitions. [2019-11-07 01:13:39,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 511 transitions. [2019-11-07 01:13:39,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:13:39,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:39,603 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:39,604 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:39,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:39,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1777100668, now seen corresponding path program 1 times [2019-11-07 01:13:39,604 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:39,605 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852120939] [2019-11-07 01:13:39,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:13:39,673 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852120939] [2019-11-07 01:13:39,673 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:39,674 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:39,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208478316] [2019-11-07 01:13:39,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:39,675 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:39,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:39,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:39,676 INFO L87 Difference]: Start difference. First operand 314 states and 511 transitions. Second operand 5 states. [2019-11-07 01:13:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:39,882 INFO L93 Difference]: Finished difference Result 646 states and 1058 transitions. [2019-11-07 01:13:39,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:39,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-07 01:13:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:39,885 INFO L225 Difference]: With dead ends: 646 [2019-11-07 01:13:39,885 INFO L226 Difference]: Without dead ends: 345 [2019-11-07 01:13:39,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-07 01:13:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-07 01:13:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-07 01:13:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 558 transitions. [2019-11-07 01:13:39,905 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 558 transitions. Word has length 106 [2019-11-07 01:13:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:39,906 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 558 transitions. [2019-11-07 01:13:39,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 558 transitions. [2019-11-07 01:13:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 01:13:39,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:39,908 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:39,909 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:39,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:39,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1284309403, now seen corresponding path program 1 times [2019-11-07 01:13:39,909 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:39,909 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089487364] [2019-11-07 01:13:39,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:13:39,975 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089487364] [2019-11-07 01:13:39,975 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:39,976 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:39,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601068774] [2019-11-07 01:13:39,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:39,977 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:39,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:39,993 INFO L87 Difference]: Start difference. First operand 343 states and 558 transitions. Second operand 5 states. [2019-11-07 01:13:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:40,191 INFO L93 Difference]: Finished difference Result 675 states and 1101 transitions. [2019-11-07 01:13:40,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:40,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-11-07 01:13:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:40,197 INFO L225 Difference]: With dead ends: 675 [2019-11-07 01:13:40,197 INFO L226 Difference]: Without dead ends: 345 [2019-11-07 01:13:40,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-07 01:13:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-11-07 01:13:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-07 01:13:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 554 transitions. [2019-11-07 01:13:40,215 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 554 transitions. Word has length 107 [2019-11-07 01:13:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:40,216 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 554 transitions. [2019-11-07 01:13:40,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 554 transitions. [2019-11-07 01:13:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-07 01:13:40,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:40,218 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:40,218 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1845761004, now seen corresponding path program 1 times [2019-11-07 01:13:40,219 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:40,219 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615038664] [2019-11-07 01:13:40,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:13:40,291 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615038664] [2019-11-07 01:13:40,291 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:40,291 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:40,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570691106] [2019-11-07 01:13:40,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:40,292 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:40,293 INFO L87 Difference]: Start difference. First operand 343 states and 554 transitions. Second operand 5 states. [2019-11-07 01:13:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:40,489 INFO L93 Difference]: Finished difference Result 708 states and 1151 transitions. [2019-11-07 01:13:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:40,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-11-07 01:13:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:40,492 INFO L225 Difference]: With dead ends: 708 [2019-11-07 01:13:40,492 INFO L226 Difference]: Without dead ends: 378 [2019-11-07 01:13:40,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-07 01:13:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-11-07 01:13:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-07 01:13:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 596 transitions. [2019-11-07 01:13:40,511 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 596 transitions. Word has length 108 [2019-11-07 01:13:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:40,511 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 596 transitions. [2019-11-07 01:13:40,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 596 transitions. [2019-11-07 01:13:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-07 01:13:40,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:40,513 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:40,513 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2036530603, now seen corresponding path program 1 times [2019-11-07 01:13:40,514 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:40,514 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700411670] [2019-11-07 01:13:40,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:13:40,569 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700411670] [2019-11-07 01:13:40,569 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:40,569 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:40,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482482882] [2019-11-07 01:13:40,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:40,570 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:40,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:40,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:40,571 INFO L87 Difference]: Start difference. First operand 370 states and 596 transitions. Second operand 5 states. [2019-11-07 01:13:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:40,792 INFO L93 Difference]: Finished difference Result 735 states and 1188 transitions. [2019-11-07 01:13:40,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:40,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-07 01:13:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:40,796 INFO L225 Difference]: With dead ends: 735 [2019-11-07 01:13:40,796 INFO L226 Difference]: Without dead ends: 378 [2019-11-07 01:13:40,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-07 01:13:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-11-07 01:13:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-07 01:13:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 591 transitions. [2019-11-07 01:13:40,813 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 591 transitions. Word has length 109 [2019-11-07 01:13:40,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:40,813 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 591 transitions. [2019-11-07 01:13:40,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 591 transitions. [2019-11-07 01:13:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-07 01:13:40,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:40,815 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:40,816 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:40,816 INFO L82 PathProgramCache]: Analyzing trace with hash -346552109, now seen corresponding path program 1 times [2019-11-07 01:13:40,816 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:40,816 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077855485] [2019-11-07 01:13:40,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-07 01:13:40,876 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077855485] [2019-11-07 01:13:40,876 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:40,876 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:40,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237296282] [2019-11-07 01:13:40,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:40,877 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:40,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:40,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:40,878 INFO L87 Difference]: Start difference. First operand 370 states and 591 transitions. Second operand 5 states. [2019-11-07 01:13:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:41,065 INFO L93 Difference]: Finished difference Result 752 states and 1206 transitions. [2019-11-07 01:13:41,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:41,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-11-07 01:13:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:41,068 INFO L225 Difference]: With dead ends: 752 [2019-11-07 01:13:41,068 INFO L226 Difference]: Without dead ends: 395 [2019-11-07 01:13:41,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-07 01:13:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-11-07 01:13:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-07 01:13:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2019-11-07 01:13:41,087 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 112 [2019-11-07 01:13:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:41,087 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2019-11-07 01:13:41,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2019-11-07 01:13:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-07 01:13:41,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:41,090 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:41,090 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash 768287860, now seen corresponding path program 1 times [2019-11-07 01:13:41,090 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:41,091 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197898089] [2019-11-07 01:13:41,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-07 01:13:41,135 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197898089] [2019-11-07 01:13:41,136 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:41,136 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:41,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697929352] [2019-11-07 01:13:41,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:41,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:41,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:41,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:41,137 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand 5 states. [2019-11-07 01:13:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:41,330 INFO L93 Difference]: Finished difference Result 773 states and 1229 transitions. [2019-11-07 01:13:41,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:41,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-11-07 01:13:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:41,333 INFO L225 Difference]: With dead ends: 773 [2019-11-07 01:13:41,334 INFO L226 Difference]: Without dead ends: 395 [2019-11-07 01:13:41,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-07 01:13:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-11-07 01:13:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-07 01:13:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 614 transitions. [2019-11-07 01:13:41,353 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 614 transitions. Word has length 113 [2019-11-07 01:13:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:41,353 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 614 transitions. [2019-11-07 01:13:41,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 614 transitions. [2019-11-07 01:13:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-07 01:13:41,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:41,355 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:41,355 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:41,356 INFO L82 PathProgramCache]: Analyzing trace with hash -105487368, now seen corresponding path program 1 times [2019-11-07 01:13:41,356 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:41,356 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696849520] [2019-11-07 01:13:41,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-07 01:13:41,408 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696849520] [2019-11-07 01:13:41,408 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:41,408 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:41,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195972008] [2019-11-07 01:13:41,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:41,409 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:41,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:41,410 INFO L87 Difference]: Start difference. First operand 391 states and 614 transitions. Second operand 3 states. [2019-11-07 01:13:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:41,493 INFO L93 Difference]: Finished difference Result 1144 states and 1806 transitions. [2019-11-07 01:13:41,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:41,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-11-07 01:13:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:41,498 INFO L225 Difference]: With dead ends: 1144 [2019-11-07 01:13:41,499 INFO L226 Difference]: Without dead ends: 766 [2019-11-07 01:13:41,501 INFO L630 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-11-07 01:13:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-11-07 01:13:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2019-11-07 01:13:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-11-07 01:13:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1207 transitions. [2019-11-07 01:13:41,532 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1207 transitions. Word has length 128 [2019-11-07 01:13:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:41,533 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1207 transitions. [2019-11-07 01:13:41,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1207 transitions. [2019-11-07 01:13:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-07 01:13:41,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:41,536 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:41,536 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1228256447, now seen corresponding path program 1 times [2019-11-07 01:13:41,537 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:41,537 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507165672] [2019-11-07 01:13:41,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-07 01:13:41,605 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507165672] [2019-11-07 01:13:41,607 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:41,607 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:41,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319423217] [2019-11-07 01:13:41,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:41,608 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:41,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:41,609 INFO L87 Difference]: Start difference. First operand 766 states and 1207 transitions. Second operand 5 states. [2019-11-07 01:13:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:41,847 INFO L93 Difference]: Finished difference Result 1603 states and 2533 transitions. [2019-11-07 01:13:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:41,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-11-07 01:13:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:41,852 INFO L225 Difference]: With dead ends: 1603 [2019-11-07 01:13:41,852 INFO L226 Difference]: Without dead ends: 850 [2019-11-07 01:13:41,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-11-07 01:13:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 842. [2019-11-07 01:13:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-11-07 01:13:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1325 transitions. [2019-11-07 01:13:41,887 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1325 transitions. Word has length 129 [2019-11-07 01:13:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:41,888 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1325 transitions. [2019-11-07 01:13:41,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1325 transitions. [2019-11-07 01:13:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 01:13:41,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:41,891 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:41,891 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:41,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:41,892 INFO L82 PathProgramCache]: Analyzing trace with hash 998366491, now seen corresponding path program 1 times [2019-11-07 01:13:41,892 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:41,892 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916320520] [2019-11-07 01:13:41,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-07 01:13:41,960 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916320520] [2019-11-07 01:13:41,960 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:41,960 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:41,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786594036] [2019-11-07 01:13:41,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:41,961 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:41,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:41,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:41,962 INFO L87 Difference]: Start difference. First operand 842 states and 1325 transitions. Second operand 5 states. [2019-11-07 01:13:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:42,334 INFO L93 Difference]: Finished difference Result 1679 states and 2645 transitions. [2019-11-07 01:13:42,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:42,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-11-07 01:13:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:42,340 INFO L225 Difference]: With dead ends: 1679 [2019-11-07 01:13:42,341 INFO L226 Difference]: Without dead ends: 846 [2019-11-07 01:13:42,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-07 01:13:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 838. [2019-11-07 01:13:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-07 01:13:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1313 transitions. [2019-11-07 01:13:42,384 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1313 transitions. Word has length 130 [2019-11-07 01:13:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:42,385 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1313 transitions. [2019-11-07 01:13:42,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1313 transitions. [2019-11-07 01:13:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-07 01:13:42,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:42,389 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:42,389 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:42,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:42,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1190868920, now seen corresponding path program 1 times [2019-11-07 01:13:42,390 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:42,390 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112735064] [2019-11-07 01:13:42,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-07 01:13:42,449 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112735064] [2019-11-07 01:13:42,449 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:42,449 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:42,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853434318] [2019-11-07 01:13:42,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:42,450 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:42,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:42,451 INFO L87 Difference]: Start difference. First operand 838 states and 1313 transitions. Second operand 5 states. [2019-11-07 01:13:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:42,697 INFO L93 Difference]: Finished difference Result 1739 states and 2729 transitions. [2019-11-07 01:13:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:42,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-11-07 01:13:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:42,703 INFO L225 Difference]: With dead ends: 1739 [2019-11-07 01:13:42,703 INFO L226 Difference]: Without dead ends: 914 [2019-11-07 01:13:42,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-11-07 01:13:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2019-11-07 01:13:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-11-07 01:13:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1421 transitions. [2019-11-07 01:13:42,748 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1421 transitions. Word has length 162 [2019-11-07 01:13:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:42,749 INFO L462 AbstractCegarLoop]: Abstraction has 910 states and 1421 transitions. [2019-11-07 01:13:42,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1421 transitions. [2019-11-07 01:13:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-07 01:13:42,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:42,753 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:42,754 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:42,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:42,754 INFO L82 PathProgramCache]: Analyzing trace with hash -618678002, now seen corresponding path program 1 times [2019-11-07 01:13:42,754 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:42,754 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975641147] [2019-11-07 01:13:42,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-07 01:13:42,820 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975641147] [2019-11-07 01:13:42,821 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:42,821 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:42,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885403068] [2019-11-07 01:13:42,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:42,823 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:42,823 INFO L87 Difference]: Start difference. First operand 910 states and 1421 transitions. Second operand 5 states. [2019-11-07 01:13:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:43,085 INFO L93 Difference]: Finished difference Result 1811 states and 2829 transitions. [2019-11-07 01:13:43,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:43,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-11-07 01:13:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:43,091 INFO L225 Difference]: With dead ends: 1811 [2019-11-07 01:13:43,091 INFO L226 Difference]: Without dead ends: 910 [2019-11-07 01:13:43,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-11-07 01:13:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 906. [2019-11-07 01:13:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-07 01:13:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1407 transitions. [2019-11-07 01:13:43,148 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1407 transitions. Word has length 163 [2019-11-07 01:13:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:43,148 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1407 transitions. [2019-11-07 01:13:43,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1407 transitions. [2019-11-07 01:13:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-07 01:13:43,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:43,152 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:43,152 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1613187866, now seen corresponding path program 1 times [2019-11-07 01:13:43,153 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:43,153 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834923191] [2019-11-07 01:13:43,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-07 01:13:43,230 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834923191] [2019-11-07 01:13:43,230 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:43,231 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:43,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306731798] [2019-11-07 01:13:43,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:43,232 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:43,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:43,232 INFO L87 Difference]: Start difference. First operand 906 states and 1407 transitions. Second operand 5 states. [2019-11-07 01:13:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:43,526 INFO L93 Difference]: Finished difference Result 1871 states and 2909 transitions. [2019-11-07 01:13:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:43,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-11-07 01:13:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:43,533 INFO L225 Difference]: With dead ends: 1871 [2019-11-07 01:13:43,533 INFO L226 Difference]: Without dead ends: 978 [2019-11-07 01:13:43,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:43,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-07 01:13:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-11-07 01:13:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-07 01:13:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1505 transitions. [2019-11-07 01:13:43,584 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1505 transitions. Word has length 193 [2019-11-07 01:13:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:43,585 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1505 transitions. [2019-11-07 01:13:43,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1505 transitions. [2019-11-07 01:13:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-07 01:13:43,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:43,590 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:43,590 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180736, now seen corresponding path program 1 times [2019-11-07 01:13:43,591 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:43,591 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763062255] [2019-11-07 01:13:43,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-07 01:13:43,667 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763062255] [2019-11-07 01:13:43,667 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:43,668 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:43,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107844356] [2019-11-07 01:13:43,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:43,669 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:43,669 INFO L87 Difference]: Start difference. First operand 974 states and 1505 transitions. Second operand 5 states. [2019-11-07 01:13:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:43,928 INFO L93 Difference]: Finished difference Result 1939 states and 2997 transitions. [2019-11-07 01:13:43,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:43,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 194 [2019-11-07 01:13:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:43,934 INFO L225 Difference]: With dead ends: 1939 [2019-11-07 01:13:43,934 INFO L226 Difference]: Without dead ends: 974 [2019-11-07 01:13:43,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-07 01:13:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 970. [2019-11-07 01:13:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-11-07 01:13:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1489 transitions. [2019-11-07 01:13:43,981 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1489 transitions. Word has length 194 [2019-11-07 01:13:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:43,981 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1489 transitions. [2019-11-07 01:13:43,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1489 transitions. [2019-11-07 01:13:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-07 01:13:43,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:43,986 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:43,986 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1741358840, now seen corresponding path program 1 times [2019-11-07 01:13:43,987 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:43,987 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209468039] [2019-11-07 01:13:43,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-07 01:13:44,060 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209468039] [2019-11-07 01:13:44,060 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:44,060 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:44,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877695637] [2019-11-07 01:13:44,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:44,061 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:44,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:44,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:44,062 INFO L87 Difference]: Start difference. First operand 970 states and 1489 transitions. Second operand 5 states. [2019-11-07 01:13:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:44,382 INFO L93 Difference]: Finished difference Result 2003 states and 3085 transitions. [2019-11-07 01:13:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:44,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-11-07 01:13:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:44,390 INFO L225 Difference]: With dead ends: 2003 [2019-11-07 01:13:44,390 INFO L226 Difference]: Without dead ends: 1046 [2019-11-07 01:13:44,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-11-07 01:13:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-11-07 01:13:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-11-07 01:13:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1553 transitions. [2019-11-07 01:13:44,458 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1553 transitions. Word has length 212 [2019-11-07 01:13:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:44,459 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1553 transitions. [2019-11-07 01:13:44,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1553 transitions. [2019-11-07 01:13:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-07 01:13:44,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:44,467 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:44,467 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:44,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:44,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1179693335, now seen corresponding path program 1 times [2019-11-07 01:13:44,469 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:44,469 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646375394] [2019-11-07 01:13:44,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-07 01:13:44,597 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646375394] [2019-11-07 01:13:44,597 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:44,598 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:44,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612840757] [2019-11-07 01:13:44,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:44,601 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:44,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:44,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:44,601 INFO L87 Difference]: Start difference. First operand 1020 states and 1553 transitions. Second operand 5 states. [2019-11-07 01:13:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:44,972 INFO L93 Difference]: Finished difference Result 2053 states and 3131 transitions. [2019-11-07 01:13:44,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:44,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-11-07 01:13:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:44,980 INFO L225 Difference]: With dead ends: 2053 [2019-11-07 01:13:44,980 INFO L226 Difference]: Without dead ends: 1046 [2019-11-07 01:13:44,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:44,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-11-07 01:13:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-11-07 01:13:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-11-07 01:13:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1535 transitions. [2019-11-07 01:13:45,058 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1535 transitions. Word has length 213 [2019-11-07 01:13:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:45,058 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1535 transitions. [2019-11-07 01:13:45,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1535 transitions. [2019-11-07 01:13:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-07 01:13:45,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:45,066 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:45,066 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:45,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:45,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2078256648, now seen corresponding path program 1 times [2019-11-07 01:13:45,068 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:45,068 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679905554] [2019-11-07 01:13:45,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-07 01:13:45,209 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679905554] [2019-11-07 01:13:45,209 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:45,210 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:45,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569032705] [2019-11-07 01:13:45,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:45,211 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:45,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:45,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:45,214 INFO L87 Difference]: Start difference. First operand 1020 states and 1535 transitions. Second operand 5 states. [2019-11-07 01:13:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:45,550 INFO L93 Difference]: Finished difference Result 2035 states and 3063 transitions. [2019-11-07 01:13:45,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:45,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 224 [2019-11-07 01:13:45,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:45,556 INFO L225 Difference]: With dead ends: 2035 [2019-11-07 01:13:45,556 INFO L226 Difference]: Without dead ends: 1028 [2019-11-07 01:13:45,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-11-07 01:13:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1020. [2019-11-07 01:13:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-11-07 01:13:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1523 transitions. [2019-11-07 01:13:45,619 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1523 transitions. Word has length 224 [2019-11-07 01:13:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:45,619 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1523 transitions. [2019-11-07 01:13:45,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1523 transitions. [2019-11-07 01:13:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-07 01:13:45,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:45,625 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:45,625 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:45,625 INFO L82 PathProgramCache]: Analyzing trace with hash -836415730, now seen corresponding path program 1 times [2019-11-07 01:13:45,626 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:45,626 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606684183] [2019-11-07 01:13:45,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-07 01:13:45,741 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606684183] [2019-11-07 01:13:45,741 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:45,742 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:45,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068492422] [2019-11-07 01:13:45,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:45,743 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:45,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:45,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:45,743 INFO L87 Difference]: Start difference. First operand 1020 states and 1523 transitions. Second operand 5 states. [2019-11-07 01:13:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:46,005 INFO L93 Difference]: Finished difference Result 2035 states and 3039 transitions. [2019-11-07 01:13:46,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:46,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-11-07 01:13:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:46,013 INFO L225 Difference]: With dead ends: 2035 [2019-11-07 01:13:46,013 INFO L226 Difference]: Without dead ends: 1010 [2019-11-07 01:13:46,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-11-07 01:13:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1002. [2019-11-07 01:13:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-11-07 01:13:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1485 transitions. [2019-11-07 01:13:46,081 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1485 transitions. Word has length 225 [2019-11-07 01:13:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:46,082 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1485 transitions. [2019-11-07 01:13:46,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1485 transitions. [2019-11-07 01:13:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-07 01:13:46,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:46,089 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:46,089 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:46,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:46,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1494389851, now seen corresponding path program 1 times [2019-11-07 01:13:46,090 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:46,090 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436228702] [2019-11-07 01:13:46,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-07 01:13:46,185 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436228702] [2019-11-07 01:13:46,185 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:46,185 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:46,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050319435] [2019-11-07 01:13:46,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:46,186 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:46,187 INFO L87 Difference]: Start difference. First operand 1002 states and 1485 transitions. Second operand 5 states. [2019-11-07 01:13:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:46,402 INFO L93 Difference]: Finished difference Result 2045 states and 3037 transitions. [2019-11-07 01:13:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:46,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-11-07 01:13:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:46,409 INFO L225 Difference]: With dead ends: 2045 [2019-11-07 01:13:46,409 INFO L226 Difference]: Without dead ends: 1056 [2019-11-07 01:13:46,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:46,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-11-07 01:13:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1048. [2019-11-07 01:13:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-11-07 01:13:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1539 transitions. [2019-11-07 01:13:46,463 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1539 transitions. Word has length 233 [2019-11-07 01:13:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:46,463 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1539 transitions. [2019-11-07 01:13:46,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1539 transitions. [2019-11-07 01:13:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-07 01:13:46,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:46,468 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:46,468 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1829546886, now seen corresponding path program 1 times [2019-11-07 01:13:46,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:46,469 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240175562] [2019-11-07 01:13:46,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-07 01:13:46,598 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240175562] [2019-11-07 01:13:46,598 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:46,598 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:13:46,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676443966] [2019-11-07 01:13:46,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:13:46,600 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:46,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:13:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:46,600 INFO L87 Difference]: Start difference. First operand 1048 states and 1539 transitions. Second operand 5 states. [2019-11-07 01:13:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:46,900 INFO L93 Difference]: Finished difference Result 2091 states and 3071 transitions. [2019-11-07 01:13:46,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:46,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-11-07 01:13:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:46,906 INFO L225 Difference]: With dead ends: 2091 [2019-11-07 01:13:46,906 INFO L226 Difference]: Without dead ends: 1048 [2019-11-07 01:13:46,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-11-07 01:13:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1040. [2019-11-07 01:13:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-07 01:13:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1507 transitions. [2019-11-07 01:13:46,963 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1507 transitions. Word has length 234 [2019-11-07 01:13:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:46,964 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1507 transitions. [2019-11-07 01:13:46,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:13:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1507 transitions. [2019-11-07 01:13:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-07 01:13:46,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:46,968 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:46,969 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash 678328095, now seen corresponding path program 1 times [2019-11-07 01:13:46,969 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:46,969 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818495558] [2019-11-07 01:13:46,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-07 01:13:47,072 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818495558] [2019-11-07 01:13:47,072 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451327847] [2019-11-07 01:13:47,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:47,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:13:47,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-07 01:13:47,365 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-07 01:13:47,471 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:47,471 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:13:47,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380035571] [2019-11-07 01:13:47,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:47,472 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:47,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:47,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:47,473 INFO L87 Difference]: Start difference. First operand 1040 states and 1507 transitions. Second operand 3 states. [2019-11-07 01:13:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:47,572 INFO L93 Difference]: Finished difference Result 2579 states and 3740 transitions. [2019-11-07 01:13:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:47,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-07 01:13:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:47,580 INFO L225 Difference]: With dead ends: 2579 [2019-11-07 01:13:47,580 INFO L226 Difference]: Without dead ends: 1552 [2019-11-07 01:13:47,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 539 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-11-07 01:13:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2019-11-07 01:13:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-11-07 01:13:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2249 transitions. [2019-11-07 01:13:47,675 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2249 transitions. Word has length 270 [2019-11-07 01:13:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:47,676 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 2249 transitions. [2019-11-07 01:13:47,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2249 transitions. [2019-11-07 01:13:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-07 01:13:47,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:47,686 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:47,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:47,901 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash -230386138, now seen corresponding path program 1 times [2019-11-07 01:13:47,902 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:47,902 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23027196] [2019-11-07 01:13:47,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-07 01:13:48,043 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23027196] [2019-11-07 01:13:48,043 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:48,043 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:48,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047312365] [2019-11-07 01:13:48,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:48,044 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:48,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:48,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:48,045 INFO L87 Difference]: Start difference. First operand 1552 states and 2249 transitions. Second operand 3 states. [2019-11-07 01:13:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:48,197 INFO L93 Difference]: Finished difference Result 4547 states and 6592 transitions. [2019-11-07 01:13:48,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:48,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-07 01:13:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:48,212 INFO L225 Difference]: With dead ends: 4547 [2019-11-07 01:13:48,212 INFO L226 Difference]: Without dead ends: 3008 [2019-11-07 01:13:48,217 INFO L630 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-11-07 01:13:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-11-07 01:13:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3007. [2019-11-07 01:13:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3007 states. [2019-11-07 01:13:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4350 transitions. [2019-11-07 01:13:48,420 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4350 transitions. Word has length 278 [2019-11-07 01:13:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:48,422 INFO L462 AbstractCegarLoop]: Abstraction has 3007 states and 4350 transitions. [2019-11-07 01:13:48,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4350 transitions. [2019-11-07 01:13:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-07 01:13:48,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:48,438 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:48,438 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash -860287162, now seen corresponding path program 1 times [2019-11-07 01:13:48,442 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:48,442 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992498846] [2019-11-07 01:13:48,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-07 01:13:48,617 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992498846] [2019-11-07 01:13:48,618 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:48,618 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:48,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804002537] [2019-11-07 01:13:48,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:48,619 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:48,620 INFO L87 Difference]: Start difference. First operand 3007 states and 4350 transitions. Second operand 3 states. [2019-11-07 01:13:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:48,988 INFO L93 Difference]: Finished difference Result 6121 states and 8875 transitions. [2019-11-07 01:13:48,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:48,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-11-07 01:13:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:49,002 INFO L225 Difference]: With dead ends: 6121 [2019-11-07 01:13:49,002 INFO L226 Difference]: Without dead ends: 2006 [2019-11-07 01:13:49,015 INFO L630 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-11-07 01:13:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-11-07 01:13:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1986. [2019-11-07 01:13:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2019-11-07 01:13:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2824 transitions. [2019-11-07 01:13:49,163 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2824 transitions. Word has length 315 [2019-11-07 01:13:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:49,164 INFO L462 AbstractCegarLoop]: Abstraction has 1986 states and 2824 transitions. [2019-11-07 01:13:49,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2824 transitions. [2019-11-07 01:13:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-07 01:13:49,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:49,181 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:49,181 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:49,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2044603392, now seen corresponding path program 1 times [2019-11-07 01:13:49,182 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:49,182 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401117819] [2019-11-07 01:13:49,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-11-07 01:13:49,439 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401117819] [2019-11-07 01:13:49,443 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619139136] [2019-11-07 01:13:49,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:49,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:49,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-11-07 01:13:49,709 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-11-07 01:13:49,844 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:49,845 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:13:49,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456120975] [2019-11-07 01:13:49,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:49,850 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:49,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:49,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:49,851 INFO L87 Difference]: Start difference. First operand 1986 states and 2824 transitions. Second operand 3 states. [2019-11-07 01:13:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:49,979 INFO L93 Difference]: Finished difference Result 4612 states and 6551 transitions. [2019-11-07 01:13:49,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:49,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-11-07 01:13:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:50,009 INFO L225 Difference]: With dead ends: 4612 [2019-11-07 01:13:50,009 INFO L226 Difference]: Without dead ends: 2639 [2019-11-07 01:13:50,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-11-07 01:13:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2639. [2019-11-07 01:13:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-11-07 01:13:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3738 transitions. [2019-11-07 01:13:50,144 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3738 transitions. Word has length 382 [2019-11-07 01:13:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:50,145 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 3738 transitions. [2019-11-07 01:13:50,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3738 transitions. [2019-11-07 01:13:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-07 01:13:50,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:50,157 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:50,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:50,366 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:50,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:50,366 INFO L82 PathProgramCache]: Analyzing trace with hash 134700959, now seen corresponding path program 1 times [2019-11-07 01:13:50,367 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:50,367 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049380049] [2019-11-07 01:13:50,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-07 01:13:50,582 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049380049] [2019-11-07 01:13:50,582 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292903126] [2019-11-07 01:13:50,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:50,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:50,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-11-07 01:13:50,927 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-11-07 01:13:51,105 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:51,106 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:13:51,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425820894] [2019-11-07 01:13:51,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:51,107 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:51,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:51,107 INFO L87 Difference]: Start difference. First operand 2639 states and 3738 transitions. Second operand 3 states. [2019-11-07 01:13:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:51,195 INFO L93 Difference]: Finished difference Result 2700 states and 3825 transitions. [2019-11-07 01:13:51,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:51,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-11-07 01:13:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:51,203 INFO L225 Difference]: With dead ends: 2700 [2019-11-07 01:13:51,203 INFO L226 Difference]: Without dead ends: 2106 [2019-11-07 01:13:51,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-11-07 01:13:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2048. [2019-11-07 01:13:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-11-07 01:13:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2908 transitions. [2019-11-07 01:13:51,296 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2908 transitions. Word has length 453 [2019-11-07 01:13:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:51,297 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 2908 transitions. [2019-11-07 01:13:51,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2908 transitions. [2019-11-07 01:13:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-07 01:13:51,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:51,307 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:51,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:51,511 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1776341599, now seen corresponding path program 1 times [2019-11-07 01:13:51,512 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:51,512 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181290908] [2019-11-07 01:13:51,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-07 01:13:51,698 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181290908] [2019-11-07 01:13:51,699 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428926228] [2019-11-07 01:13:51,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:51,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:51,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-07 01:13:52,027 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-07 01:13:52,164 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1811539395] [2019-11-07 01:13:52,169 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 454 [2019-11-07 01:13:52,239 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:52,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:52,677 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:54,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:54,216 INFO L272 AbstractInterpreter]: Visited 103 different actions 2161 times. Merged at 88 different actions 1789 times. Widened at 19 different actions 265 times. Performed 5181 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5181 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 245 fixpoints after 28 different actions. Largest state had 95 variables. [2019-11-07 01:13:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:54,222 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:54,222 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:54,223 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:54,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414679207] [2019-11-07 01:13:54,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:54,224 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:54,225 INFO L87 Difference]: Start difference. First operand 2048 states and 2908 transitions. Second operand 6 states. [2019-11-07 01:13:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:54,698 INFO L93 Difference]: Finished difference Result 4236 states and 6005 transitions. [2019-11-07 01:13:54,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:13:54,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 453 [2019-11-07 01:13:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:54,711 INFO L225 Difference]: With dead ends: 4236 [2019-11-07 01:13:54,711 INFO L226 Difference]: Without dead ends: 2157 [2019-11-07 01:13:54,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 907 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:13:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-11-07 01:13:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1910. [2019-11-07 01:13:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-11-07 01:13:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2585 transitions. [2019-11-07 01:13:54,849 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2585 transitions. Word has length 453 [2019-11-07 01:13:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:54,849 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2585 transitions. [2019-11-07 01:13:54,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2585 transitions. [2019-11-07 01:13:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2019-11-07 01:13:54,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:54,868 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:55,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:55,081 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:55,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1812552048, now seen corresponding path program 1 times [2019-11-07 01:13:55,082 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:55,082 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941245121] [2019-11-07 01:13:55,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-07 01:13:55,692 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941245121] [2019-11-07 01:13:55,692 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843394559] [2019-11-07 01:13:55,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:55,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:55,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-07 01:13:56,302 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-07 01:13:56,777 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [599847794] [2019-11-07 01:13:56,778 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 855 [2019-11-07 01:13:56,801 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:56,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:56,939 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:58,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:58,378 INFO L272 AbstractInterpreter]: Visited 115 different actions 2356 times. Merged at 96 different actions 1896 times. Widened at 22 different actions 290 times. Performed 5861 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5861 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 296 fixpoints after 23 different actions. Largest state had 99 variables. [2019-11-07 01:13:58,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:58,378 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:58,378 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:58,379 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:58,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061398277] [2019-11-07 01:13:58,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:58,381 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:58,381 INFO L87 Difference]: Start difference. First operand 1910 states and 2585 transitions. Second operand 6 states. [2019-11-07 01:13:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:58,990 INFO L93 Difference]: Finished difference Result 5655 states and 7784 transitions. [2019-11-07 01:13:58,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:13:58,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 854 [2019-11-07 01:13:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:58,998 INFO L225 Difference]: With dead ends: 5655 [2019-11-07 01:13:58,998 INFO L226 Difference]: Without dead ends: 3619 [2019-11-07 01:13:59,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1717 GetRequests, 1710 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:13:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2019-11-07 01:13:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 2170. [2019-11-07 01:13:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-11-07 01:13:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2977 transitions. [2019-11-07 01:13:59,102 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2977 transitions. Word has length 854 [2019-11-07 01:13:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:59,103 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2977 transitions. [2019-11-07 01:13:59,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2977 transitions. [2019-11-07 01:13:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2019-11-07 01:13:59,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:59,157 INFO L410 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:59,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:59,364 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1607522492, now seen corresponding path program 1 times [2019-11-07 01:13:59,365 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:59,365 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601630186] [2019-11-07 01:13:59,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-11-07 01:13:59,938 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601630186] [2019-11-07 01:13:59,938 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:59,939 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:59,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975736311] [2019-11-07 01:13:59,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:59,940 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:59,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:59,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:59,940 INFO L87 Difference]: Start difference. First operand 2170 states and 2977 transitions. Second operand 3 states. [2019-11-07 01:14:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:00,149 INFO L93 Difference]: Finished difference Result 4361 states and 5976 transitions. [2019-11-07 01:14:00,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:00,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1035 [2019-11-07 01:14:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:00,155 INFO L225 Difference]: With dead ends: 4361 [2019-11-07 01:14:00,155 INFO L226 Difference]: Without dead ends: 2210 [2019-11-07 01:14:00,159 INFO L630 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-11-07 01:14:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-11-07 01:14:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2170. [2019-11-07 01:14:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-11-07 01:14:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2957 transitions. [2019-11-07 01:14:00,251 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2957 transitions. Word has length 1035 [2019-11-07 01:14:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:00,252 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2957 transitions. [2019-11-07 01:14:00,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2957 transitions. [2019-11-07 01:14:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2019-11-07 01:14:00,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:00,267 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:00,267 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash 123556935, now seen corresponding path program 1 times [2019-11-07 01:14:00,268 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:00,268 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898398766] [2019-11-07 01:14:00,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-11-07 01:14:00,780 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898398766] [2019-11-07 01:14:00,780 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:00,780 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:00,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830787433] [2019-11-07 01:14:00,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:00,781 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:00,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:00,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:00,782 INFO L87 Difference]: Start difference. First operand 2170 states and 2957 transitions. Second operand 3 states. [2019-11-07 01:14:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:00,982 INFO L93 Difference]: Finished difference Result 4342 states and 5914 transitions. [2019-11-07 01:14:00,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:00,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1050 [2019-11-07 01:14:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:00,988 INFO L225 Difference]: With dead ends: 4342 [2019-11-07 01:14:00,988 INFO L226 Difference]: Without dead ends: 2191 [2019-11-07 01:14:00,992 INFO L630 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-11-07 01:14:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-11-07 01:14:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2170. [2019-11-07 01:14:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-11-07 01:14:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2941 transitions. [2019-11-07 01:14:01,079 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2941 transitions. Word has length 1050 [2019-11-07 01:14:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:01,080 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2941 transitions. [2019-11-07 01:14:01,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2941 transitions. [2019-11-07 01:14:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2019-11-07 01:14:01,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:01,094 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:01,094 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:01,095 INFO L82 PathProgramCache]: Analyzing trace with hash 860689758, now seen corresponding path program 1 times [2019-11-07 01:14:01,095 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:01,095 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387308120] [2019-11-07 01:14:01,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-11-07 01:14:02,057 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387308120] [2019-11-07 01:14:02,057 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:02,057 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:02,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49056466] [2019-11-07 01:14:02,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:02,058 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:02,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:02,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:02,059 INFO L87 Difference]: Start difference. First operand 2170 states and 2941 transitions. Second operand 3 states. [2019-11-07 01:14:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:02,232 INFO L93 Difference]: Finished difference Result 4395 states and 5959 transitions. [2019-11-07 01:14:02,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:02,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1078 [2019-11-07 01:14:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:02,238 INFO L225 Difference]: With dead ends: 4395 [2019-11-07 01:14:02,238 INFO L226 Difference]: Without dead ends: 2226 [2019-11-07 01:14:02,242 INFO L630 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-11-07 01:14:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2019-11-07 01:14:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2212. [2019-11-07 01:14:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2019-11-07 01:14:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 2977 transitions. [2019-11-07 01:14:02,345 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 2977 transitions. Word has length 1078 [2019-11-07 01:14:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:02,347 INFO L462 AbstractCegarLoop]: Abstraction has 2212 states and 2977 transitions. [2019-11-07 01:14:02,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2977 transitions. [2019-11-07 01:14:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-11-07 01:14:02,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:02,366 INFO L410 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:02,367 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1775510994, now seen corresponding path program 1 times [2019-11-07 01:14:02,368 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:02,368 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222758169] [2019-11-07 01:14:02,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-11-07 01:14:03,049 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222758169] [2019-11-07 01:14:03,049 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:03,049 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:14:03,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587922026] [2019-11-07 01:14:03,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:03,050 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:03,051 INFO L87 Difference]: Start difference. First operand 2212 states and 2977 transitions. Second operand 3 states. [2019-11-07 01:14:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:03,195 INFO L93 Difference]: Finished difference Result 2846 states and 3818 transitions. [2019-11-07 01:14:03,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:03,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1110 [2019-11-07 01:14:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:03,196 INFO L225 Difference]: With dead ends: 2846 [2019-11-07 01:14:03,196 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 01:14:03,200 INFO L630 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-11-07 01:14:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 01:14:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 01:14:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 01:14:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 01:14:03,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1110 [2019-11-07 01:14:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:03,202 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 01:14:03,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 01:14:03,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 01:14:03,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 01:14:03,928 WARN L191 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 198